oj.uz

Submission #130851

# Submission time Handle Problem Language Result Execution time Memory
130851 2019-07-16T07:23:39 Z 윤교준(#3170) Bodyguards (CEOI10_bodyguards) C++14
50 / 100
 470 ms 262148 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define befv(V) ((V)[sz(V)-2])
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
inline void fuk() { puts("0"); exit(0); }

const int MAXX = 1000055;

int SX[MAXX], SY[MAXX];
int AX[MAXX], AY[MAXX];
vector<int> XV, YV;

void solve() {
	sorv(XV); revv(XV);
	sorv(YV); revv(YV);
	for(int x : XV) SX[x]++;
	for(int y : YV) SY[y]++;
	for(int i = MAXX-2; 0 <= i; i--) {
		SX[i] += SX[i+1];
		SY[i] += SY[i+1];
	}
	for(int i = 1; i < MAXX; i++) {
		AX[i] = SX[i] + AX[i-1];
		AY[i] = SY[i] + AY[i-1];
	}
	{
		int sum = 0;
		for(int i = 0, n = sz(XV); i < n; i++) {
			sum += XV[i];
			if(AY[i+1] < sum) fuk();
		}
	}
	{
		int sum = 0;
		for(int i = 0, n = sz(YV); i < n; i++) {
			sum += YV[i];
			if(AX[i+1] < sum) fuk();
		}
	}
	puts("1");
}

void input() {
	ios::sync_with_stdio(false);

	int N;
	cin >> N;
	for(int a, b; N--;) {
		cin >> a >> b;
		for(; b--;) XV.eb(a);
	}
	cin >> N;
	for(int a, b; N--;) {
		cin >> a >> b;
		for(; b--;) YV.eb(a);
	}
}

int main() {
	input();
	solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 15992 KB Output is correct
2 Correct 19 ms 15992 KB Output is correct
3 Correct 19 ms 15992 KB Output is correct
4 Correct 19 ms 15992 KB Output is correct
5 Correct 19 ms 15992 KB Output is correct
6 Correct 19 ms 15992 KB Output is correct
7 Correct 19 ms 15992 KB Output is correct
8 Correct 20 ms 15964 KB Output is correct
9 Correct 19 ms 15936 KB Output is correct
10 Correct 19 ms 15992 KB Output is correct
11 Correct 19 ms 15964 KB Output is correct
12 Correct 19 ms 15992 KB Output is correct
13 Correct 19 ms 15992 KB Output is correct
14 Correct 19 ms 15992 KB Output is correct
15 Correct 20 ms 16020 KB Output is correct
16 Correct 19 ms 16020 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 15964 KB Output is correct
2 Correct 24 ms 15964 KB Output is correct
3 Correct 19 ms 15992 KB Output is correct
4 Correct 19 ms 15936 KB Output is correct
5 Correct 19 ms 15992 KB Output is correct
6 Correct 19 ms 15992 KB Output is correct
7 Correct 19 ms 15992 KB Output is correct
8 Correct 19 ms 15992 KB Output is correct
9 Correct 19 ms 15992 KB Output is correct
10 Correct 19 ms 15980 KB Output is correct
11 Correct 19 ms 15992 KB Output is correct
12 Correct 19 ms 15972 KB Output is correct
13 Correct 20 ms 16036 KB Output is correct
14 Correct 19 ms 15992 KB Output is correct
15 Correct 19 ms 15964 KB Output is correct
16 Correct 19 ms 15992 KB Output is correct
17 Correct 19 ms 15992 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16120 KB Output is correct
2 Correct 22 ms 15992 KB Output is correct
3 Correct 23 ms 15992 KB Output is correct
4 Correct 22 ms 15992 KB Output is correct
5 Correct 19 ms 15992 KB Output is correct
6 Correct 19 ms 15992 KB Output is correct
7 Correct 19 ms 16120 KB Output is correct
8 Correct 19 ms 15992 KB Output is correct
9 Correct 19 ms 15992 KB Output is correct
10 Correct 19 ms 15992 KB Output is correct
11 Correct 19 ms 15964 KB Output is correct
12 Correct 19 ms 16056 KB Output is correct
13 Correct 19 ms 15992 KB Output is correct
14 Correct 19 ms 15992 KB Output is correct
15 Correct 19 ms 15992 KB Output is correct
16 Correct 19 ms 15992 KB Output is correct
17 Correct 19 ms 15992 KB Output is correct
18 Correct 19 ms 16120 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 15992 KB Output is correct
2 Correct 19 ms 15992 KB Output is correct
3 Correct 19 ms 15992 KB Output is correct
4 Correct 19 ms 16020 KB Output is correct
5 Correct 19 ms 15992 KB Output is correct
6 Correct 19 ms 15992 KB Output is correct
7 Correct 20 ms 16124 KB Output is correct
8 Correct 19 ms 15992 KB Output is correct
9 Correct 19 ms 15992 KB Output is correct
10 Correct 20 ms 15992 KB Output is correct
11 Correct 19 ms 15992 KB Output is correct
12 Correct 19 ms 15992 KB Output is correct
13 Correct 19 ms 15956 KB Output is correct
14 Correct 23 ms 15992 KB Output is correct
15 Correct 19 ms 15992 KB Output is correct
16 Correct 20 ms 15992 KB Output is correct
17 Correct 19 ms 15992 KB Output is correct
18 Correct 20 ms 15992 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 15992 KB Output is correct
2 Correct 22 ms 16040 KB Output is correct
3 Correct 20 ms 15992 KB Output is correct
4 Correct 19 ms 15996 KB Output is correct
5 Correct 19 ms 15992 KB Output is correct
6 Correct 19 ms 15992 KB Output is correct
7 Correct 20 ms 16120 KB Output is correct
8 Correct 20 ms 15992 KB Output is correct
9 Correct 20 ms 15992 KB Output is correct
10 Correct 19 ms 16040 KB Output is correct
11 Correct 20 ms 15992 KB Output is correct
12 Correct 20 ms 15992 KB Output is correct
13 Correct 19 ms 15992 KB Output is correct
14 Correct 23 ms 15992 KB Output is correct
15 Correct 20 ms 15996 KB Output is correct
16 Correct 22 ms 15964 KB Output is correct
17 Correct 23 ms 15992 KB Output is correct
18 Correct 20 ms 15992 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 470 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 454 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 459 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 455 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 458 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -