oj.uz

Submission #275110

# Submission time Handle Problem Language Result Execution time Memory
275110 2020-08-20T04:28:35 Z wutwere Lasers (NOI19_lasers) C++17
24 / 100
 461 ms 25744 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	map<int, int> pref;
	int l, r; cin >> l >> r;
	for (int i = 0; i < r; i++) {
		int x; cin >> x;
		vector<int> vals(x);
		int sum = 0, pos = 0;
		for (int j = 0; j < x; j++) {
			cin >> vals[j];
			sum += vals[j];
		}
		for (int j = 0; j < x; j++) {
			int len = l - sum - pos + vals[j];
			if (vals[j] - (len - vals[j]) > 0) {
				pref[l - sum]++;
				pref[l - sum + vals[j] - (len - vals[j])]--;
			}
			sum -= vals[j];
			pos += vals[j];
		}
	}
	int cnt = 0, start = 0, ans = 0;
	for (auto i : pref) {
		cnt += i.second;
		if (i.second > 0) {
			if (cnt == 1) {
				start = i.first;
			}
		} else {
			if (cnt == 0) {
				ans += i.first - start;
			}
		}
	}
	cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 150 ms 6264 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 461 ms 25744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 16140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 16140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 150 ms 6264 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 461 ms 25744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Incorrect 100 ms 16140 KB Output isn't correct
22 Halted 0 ms 0 KB -