Submission #231832

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
231832	2020-05-15T03:53:00 Z	iefnah06	Fortune Telling 2 (JOI14_fortune_telling2)	C++11	4 / 100	9 ms	640 KB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int MAXN = 1010;
int n, k;
int cards[MAXN][2];
int which[MAXN];

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> cards[i][0] >> cards[i][1];
	}

	for (int i = 0; i < n; i++) which[i] = 0;
	for (int _ = 0; _ < k; _++) {
		int t;
		cin >> t;
		for (int i = 0; i < n; i++) {
			if (cards[i][which[i]] <= t) {
				which[i] = 1 - which[i];
			}
		}
	}

	ll tot = 0;
	for (int i = 0; i < n; i++) {
		tot += cards[i][which[i]];
	}
	cout << tot << '\n';

	return 0;
}

Subtask #1

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	7 ms	384 KB	Output is correct
3	Correct	9 ms	384 KB	Output is correct
4	Correct	9 ms	384 KB	Output is correct
5	Correct	9 ms	384 KB	Output is correct
6	Correct	9 ms	384 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	7 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	6 ms	384 KB	Output is correct
11	Correct	8 ms	384 KB	Output is correct
12	Correct	9 ms	384 KB	Output is correct
13	Correct	8 ms	384 KB	Output is correct

Subtask #2

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	7 ms	384 KB	Output is correct
3	Correct	9 ms	384 KB	Output is correct
4	Correct	9 ms	384 KB	Output is correct
5	Correct	9 ms	384 KB	Output is correct
6	Correct	9 ms	384 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	7 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	6 ms	384 KB	Output is correct
11	Correct	8 ms	384 KB	Output is correct
12	Correct	9 ms	384 KB	Output is correct
13	Correct	8 ms	384 KB	Output is correct
14	Runtime error	5 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	7 ms	384 KB	Output is correct
3	Correct	9 ms	384 KB	Output is correct
4	Correct	9 ms	384 KB	Output is correct
5	Correct	9 ms	384 KB	Output is correct
6	Correct	9 ms	384 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	7 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	6 ms	384 KB	Output is correct
11	Correct	8 ms	384 KB	Output is correct
12	Correct	9 ms	384 KB	Output is correct
13	Correct	8 ms	384 KB	Output is correct
14	Runtime error	5 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-