oj.uz

Submission #344881

# Submission time Handle Problem Language Result Execution time Memory
344881 2021-01-06T17:02:47 Z wwdd Building 4 (JOI20_building4) C++14
100 / 100
 353 ms 79420 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 500500;
const ll INFL = 1e18;
typedef vector<ll> vl;
ll dp[2*MN][2][2];
vl w[2];
bool sur(int id, int pos, int val) {
	return dp[pos][id][0] <= val && dp[pos][id][1] >= val;
}
int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	ll n;
	cin >> n;
	for(int i=0;i<2;i++) {
		for(int j=0;j<2*n;j++) {
			ll t;
			cin >> t;
			w[i].push_back(t);
		}
	}
	dp[0][0][0] = dp[0][0][1] = 0;
	dp[0][1][0] = dp[0][1][1] = 1;
	for(int i=1;i<2*n;i++) {
		for(int j=0;j<2;j++) {
			dp[i][j][0] = INFL;
			dp[i][j][1] = -INFL;
			for(int k=0;k<2;k++) {
				if(w[k][i-1] <= w[j][i]) {
					dp[i][j][0] = min(dp[i-1][k][0]+j,dp[i][j][0]);
					dp[i][j][1] = max(dp[i-1][k][1]+j,dp[i][j][1]);
				}
			}
		}
	}
	int wid;
	bool poss = false;
	int rem = n;
	for(int i=0;i<2;i++) {
		if(sur(i,2*n-1,n)) {
			wid = i;poss = true;
		}
	}
	if(poss) {
	vl res;
	res.push_back(wid);
	rem -= wid;
	for(int i=2*n-1;i>0;i--) {
		int nid = -1;
		for(int j=0;j<2;j++) {
			if(w[j][i-1] <= w[wid][i] && sur(j,i-1,rem)) {
				nid = j;
			}
		}
		res.push_back(nid);
		rem -= nid;
		wid = nid;
	}
	reverse(res.begin(),res.end());
	for(int i=0;i<res.size();i++) {
		cout << char(res[i]+'A');
	}
	cout << '\n';
	} else {
		cout << -1 << '\n';
	}
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:61:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i=0;i<res.size();i++) {
      |              ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 2 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 2 ms 620 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 620 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 2 ms 620 KB Output is correct
27 Correct 2 ms 636 KB Output is correct
28 Correct 1 ms 620 KB Output is correct
29 Correct 2 ms 632 KB Output is correct
30 Correct 1 ms 620 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 2 ms 620 KB Output is correct
33 Correct 2 ms 620 KB Output is correct
34 Correct 276 ms 65800 KB Output is correct
35 Correct 301 ms 74180 KB Output is correct
36 Correct 300 ms 73176 KB Output is correct
37 Correct 301 ms 74564 KB Output is correct
38 Correct 323 ms 74384 KB Output is correct
39 Correct 342 ms 73668 KB Output is correct
40 Correct 326 ms 78468 KB Output is correct
41 Correct 293 ms 75076 KB Output is correct
42 Correct 316 ms 77020 KB Output is correct
43 Correct 339 ms 79060 KB Output is correct
44 Correct 330 ms 79120 KB Output is correct
45 Correct 325 ms 79044 KB Output is correct
46 Correct 315 ms 79044 KB Output is correct
47 Correct 304 ms 78148 KB Output is correct
48 Correct 353 ms 78056 KB Output is correct
49 Correct 309 ms 78824 KB Output is correct
50 Correct 341 ms 78236 KB Output is correct
51 Correct 326 ms 78332 KB Output is correct
52 Correct 271 ms 67320 KB Output is correct
53 Correct 250 ms 67308 KB Output is correct
54 Correct 244 ms 67360 KB Output is correct
55 Correct 248 ms 67140 KB Output is correct
56 Correct 328 ms 79420 KB Output is correct
57 Correct 277 ms 74052 KB Output is correct
58 Correct 304 ms 74384 KB Output is correct
59 Correct 294 ms 74180 KB Output is correct
60 Correct 292 ms 71032 KB Output is correct
61 Correct 293 ms 74604 KB Output is correct
62 Correct 317 ms 73768 KB Output is correct
63 Correct 285 ms 74752 KB Output is correct
64 Correct 273 ms 72656 KB Output is correct
65 Correct 291 ms 74856 KB Output is correct