Submission #339690


Source Code Expand

#include <iostream>
#include <string>
 
unsigned long long S[200000] = {}, score[200000] = {}, work[200000] = {};
 
int main()
{
	int N, Q;
	std::cin >> N;
	for(int i=0; i<N; ++i)
		std::cin >> S[i];
	std::cin >> Q;
 
	work[N-1] = S[N-1];
	for(int i=N-2; i>0; --i){
		if(work[i+1] > S[i]){
			work[i] = S[i];
			score[i] = score[i+1] + (~i&1) * work[i+1];
		} else {
			work[i] = work[i+1];
			score[i] = score[i+1] + (~i&1) * S[i];
		}
	}
	std::cout << S[0] + work[1] + score[1] << std::endl;

	for(int j=0; j<Q; ++j){
		int P;
		unsigned int D;
		std::cin >> P >> D;
		S[P-1] -= D;
		if(S[P-1]<1) S[P-1] = 1;

		for(int i=P-1; i>0; --i){
			if(i==N-1){
				work[i] = S[N-1];
			} else if(work[i+1] > S[i]){
				work[i] = S[i];
				score[i] = score[i+1] + (~i&1) * work[i+1];
			} else {
				work[i] = work[i+1];
				score[i] = score[i+1] + (~i&1) * S[i];
			}
		}
		std::cout << S[0] + work[1] + score[1] << std::endl;
	}
 
	return 0;
}

Submission Info

Submission Time
Task D - コインの取り合い
User iseekautos
Language C++ (G++ 4.6.4)
Score 10
Code Size 987 Byte
Status TLE
Exec Time 3052 ms
Memory 5920 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 10 / 10 0 / 80 0 / 90
Status
AC × 2
AC × 7
AC × 5
TLE × 9
AC × 11
TLE × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt
Subtask2 sample_01.txt, sample_02.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Subtask3 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt
Case Name Status Exec Time Memory
sample_01.txt AC 30 ms 1084 KB
sample_02.txt AC 33 ms 1084 KB
subtask1_01.txt AC 33 ms 1080 KB
subtask1_02.txt AC 172 ms 5816 KB
subtask1_03.txt AC 138 ms 4660 KB
subtask1_04.txt AC 174 ms 5816 KB
subtask1_05.txt AC 181 ms 5808 KB
subtask1_06.txt AC 91 ms 5688 KB
subtask1_07.txt AC 173 ms 5816 KB
subtask2_01.txt AC 32 ms 1148 KB
subtask2_02.txt TLE 3039 ms 3476 KB
subtask2_03.txt AC 633 ms 5788 KB
subtask2_04.txt TLE 3040 ms 5920 KB
subtask2_05.txt TLE 3041 ms 5912 KB
subtask2_06.txt TLE 3040 ms 5908 KB
subtask2_07.txt TLE 3039 ms 5916 KB
subtask2_08.txt AC 93 ms 5780 KB
subtask2_09.txt TLE 3037 ms 2712 KB
subtask2_10.txt TLE 3039 ms 5908 KB
subtask2_11.txt TLE 3038 ms 5912 KB
subtask2_12.txt TLE 3039 ms 5796 KB
subtask3_01.txt TLE 3043 ms 2324 KB
subtask3_02.txt TLE 3043 ms 5896 KB
subtask3_03.txt TLE 3052 ms 5912 KB
subtask3_04.txt TLE 3040 ms 5904 KB
subtask3_05.txt AC 92 ms 5824 KB
subtask3_06.txt TLE 3051 ms 5912 KB
subtask3_07.txt TLE 3043 ms 5908 KB
subtask3_08.txt TLE 3039 ms 5912 KB
subtask3_09.txt TLE 3038 ms 5908 KB
subtask3_10.txt TLE 3039 ms 5816 KB
subtask3_11.txt TLE 3042 ms 3740 KB
subtask3_12.txt TLE 3050 ms 5912 KB
subtask3_13.txt TLE 3041 ms 5816 KB
subtask3_14.txt TLE 3052 ms 5916 KB