oj.uz

Submission #211690

# Submission time Handle Problem Language Result Execution time Memory
211690 2020-03-21T01:19:47 Z skylee Building 4 (JOI20_building4) C++17
100 / 100
 297 ms 60996 KB 
#include<cstdio>
#include<cctype>
#include<climits>
#include<cstring>
#include<algorithm>
inline int getint() {
	register char ch;
	while(!isdigit(ch=getchar()));
	register int x=ch^'0';
	while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
	return x;
}
using int64=long long;
constexpr int N=1e6+1;
int v[N][2];
int f[N][2][2],g[N][2][2];
char s[N];
int main() {
	const int n=getint()*2;
	for(register int i=1;i<=n;i++) v[i][0]=getint();
	for(register int i=1;i<=n;i++) v[i][1]=getint();
	for(register int i=1;i<=n;i++) {
		for(register int j=0;j<2;j++) {
			for(register int k=0;k<2;k++) {
				const int l=std::min(f[i-1][k][0],f[i-1][k][1]);
				const int r=std::max(g[i-1][k][0],g[i-1][k][1]);
				if(v[i][j]<v[i-1][k]||l==INT_MAX||r==INT_MIN) {
					f[i][j][k]=INT_MAX;
					g[i][j][k]=INT_MIN;
					continue;
				}
				f[i][j][k]=l+(j?1:-1);
				g[i][j][k]=r+(j?1:-1);
			}
		}
	}
	int num=0;
	int j=std::min(f[n][1][0],f[n][1][1])<=0&&0<=std::max(g[n][1][0],g[n][1][1]);
	for(register int i=n;i>=1;i--) {
		for(register int k=0;k<2;k++) {
			if(f[i][j][k]<=num&&num<=g[i][j][k]) {
				s[i-1]='A'+j;
				num-=j?1:-1;
				j=k;
				break;
			}
		}
	}
	puts((int)strlen(s)==n?s:"-1");
	return 0;
}

Compilation message

building4.cpp: In function 'int getint()':
building4.cpp:7:16: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  register char ch;
                ^~
building4.cpp:9:15: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  register int x=ch^'0';
               ^
building4.cpp: In function 'int main()':
building4.cpp:20:19: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  for(register int i=1;i<=n;i++) v[i][0]=getint();
                   ^
building4.cpp:21:19: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  for(register int i=1;i<=n;i++) v[i][1]=getint();
                   ^
building4.cpp:22:19: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  for(register int i=1;i<=n;i++) {
                   ^
building4.cpp:23:20: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
   for(register int j=0;j<2;j++) {
                    ^
building4.cpp:24:21: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
    for(register int k=0;k<2;k++) {
                     ^
building4.cpp:39:19: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
  for(register int i=n;i>=1;i--) {
                   ^
building4.cpp:40:20: warning: ISO C++1z does not allow 'register' storage class specifier [-Wregister]
   for(register int k=0;k<2;k++) {
                    ^

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 284 ms 58104 KB Output is correct
35 Correct 267 ms 56440 KB Output is correct
36 Correct 257 ms 55416 KB Output is correct
37 Correct 264 ms 56568 KB Output is correct
38 Correct 259 ms 56504 KB Output is correct
39 Correct 245 ms 55800 KB Output is correct
40 Correct 272 ms 60140 KB Output is correct
41 Correct 275 ms 57152 KB Output is correct
42 Correct 278 ms 58768 KB Output is correct
43 Correct 297 ms 60792 KB Output is correct
44 Correct 285 ms 60792 KB Output is correct
45 Correct 287 ms 60764 KB Output is correct
46 Correct 274 ms 60764 KB Output is correct
47 Correct 269 ms 59868 KB Output is correct
48 Correct 267 ms 59580 KB Output is correct
49 Correct 275 ms 60568 KB Output is correct
50 Correct 285 ms 59868 KB Output is correct
51 Correct 276 ms 59884 KB Output is correct
52 Correct 138 ms 49012 KB Output is correct
53 Correct 138 ms 49052 KB Output is correct
54 Correct 121 ms 49016 KB Output is correct
55 Correct 122 ms 48760 KB Output is correct
56 Correct 286 ms 60996 KB Output is correct
57 Correct 219 ms 55828 KB Output is correct
58 Correct 218 ms 56040 KB Output is correct
59 Correct 218 ms 55928 KB Output is correct
60 Correct 218 ms 52944 KB Output is correct
61 Correct 222 ms 56440 KB Output is correct
62 Correct 224 ms 55672 KB Output is correct
63 Correct 223 ms 56436 KB Output is correct
64 Correct 220 ms 54504 KB Output is correct
65 Correct 230 ms 56424 KB Output is correct