oj.uz

Submission #252027

# Submission time Handle Problem Language Result Execution time Memory
252027 2020-07-23T19:19:07 Z Bruteforceman Building 4 (JOI20_building4) C++11
100 / 100
 422 ms 38288 KB 
#include "bits/stdc++.h"
using namespace std;
int a[2][500010 * 2];
int main(int argc, char const *argv[])
{
	int n;
	scanf("%d", &n);
	for(int x = 0; x < 2; x++) {
		for(int i = 0; i < 2*n; i++) {
			scanf("%d", &a[x][i]);	
		}
	}
	vector <int> v;
	if(a[0][0] <= a[1][0]) {
		v.push_back(0);
	} else {
		v.push_back(1);
	}
	for(int i = 0; i < 2*n - 1; i++) {
		int opt = -1;
		for(int x = 0; x < 2; x++) {
			if(a[v.back()][i] <= a[x][i + 1]) {
				if(opt == -1 || a[x][i + 1] < a[opt][i + 1]) {
					opt = x;
				}
			}
		}
		if(opt == -1) {
			puts("-1");
			exit(0);
		}
		v.push_back(opt);
	}
	vector <int> p (2*n + 1);
	vector <int> nxt (2*n + 1);
	p[2*n] = 0;
	for(int i = 2*n-1; i >= 0; i--) {
		p[i] = p[i + 1] + ((v[i] == 0) ? -1 : 1);
		if(i == 2*n - 1 || a[v[i] ^ 1][i] <= a[v[i + 1]][i + 1]) {
			nxt[i] = i;
		} else {
			if(a[v[i] ^ 1][i] <= a[v[i + 1] ^ 1][i + 1]) nxt[i] = nxt[i + 1];
			else nxt[i] = -1;
		}
		if(a[v[i]][i] > a[v[i] ^ 1][i]) {
			nxt[i] = -1;
		}
	}
	int sum = p[0];
	int last = 2*n;
	for(int i = 2*n - 1; i >= 0; i--) {
		if(nxt[i] == -1) continue;
		int c = min(nxt[i] + 1, last);
		int profit = p[c] - p[i];
		if(abs(sum + 2*profit) < abs(sum)) {
			sum += 2*profit;
			for(int j = i; j < c; j++) {
				v[j] ^= 1;
			}
			last = i; 
		}
	}
	if(sum == 0) {
		for(int i = 0; i < 2*n; i++) printf("%c", v[i] + 'A');
		printf("\n");
	} else printf("-1\n");
	return 0;
}

Compilation message

building4.cpp: In function 'int main(int, const char**)':
building4.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
building4.cpp:10:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[x][i]); 
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 362 ms 10436 KB Output is correct
35 Correct 402 ms 37468 KB Output is correct
36 Correct 375 ms 36828 KB Output is correct
37 Correct 390 ms 37596 KB Output is correct
38 Correct 366 ms 37632 KB Output is correct
39 Correct 344 ms 36872 KB Output is correct
40 Correct 358 ms 23388 KB Output is correct
41 Correct 316 ms 37804 KB Output is correct
42 Correct 394 ms 26716 KB Output is correct
43 Correct 422 ms 23380 KB Output is correct
44 Correct 407 ms 23440 KB Output is correct
45 Correct 420 ms 23516 KB Output is correct
46 Correct 367 ms 23388 KB Output is correct
47 Correct 367 ms 32732 KB Output is correct
48 Correct 369 ms 38288 KB Output is correct
49 Correct 369 ms 23484 KB Output is correct
50 Correct 394 ms 30940 KB Output is correct
51 Correct 394 ms 30708 KB Output is correct
52 Correct 291 ms 28592 KB Output is correct
53 Correct 309 ms 28768 KB Output is correct
54 Correct 277 ms 28764 KB Output is correct
55 Correct 270 ms 28508 KB Output is correct
56 Correct 373 ms 23516 KB Output is correct
57 Correct 316 ms 35552 KB Output is correct
58 Correct 320 ms 35800 KB Output is correct
59 Correct 321 ms 35804 KB Output is correct
60 Correct 302 ms 34012 KB Output is correct
61 Correct 337 ms 36316 KB Output is correct
62 Correct 325 ms 35548 KB Output is correct
63 Correct 339 ms 36188 KB Output is correct
64 Correct 306 ms 35036 KB Output is correct
65 Correct 324 ms 36060 KB Output is correct