답안 #212516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212516 2020-03-23T11:15:35 Z combi1k1 건물 4 (JOI20_building4) C++14
100 / 100
330 ms 27500 KB
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 1e6 + 5;

typedef pair<int,int>   ii;

int a[N][2];
int l[N][2];
int r[N][2];

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;   n += n;

    for(int i = 1 ; i <= n ; ++i)   cin >> a[i][0];
    for(int i = 1 ; i <= n ; ++i)   cin >> a[i][1];

    for(int i = 1 ; i <= n ; ++i)   {
        l[i][0] = l[i][1] = 1e9;
        r[i][0] = r[i][1] = -1e9;

        for(int x = 0 ; x < 2 ; ++x)
        for(int y = 0 ; y < 2 ; ++y)    if (a[i - 1][x] <= a[i][y]) {
            l[i][y] = min(l[i][y],l[i - 1][x] + (y == 0));
            r[i][y] = max(r[i][y],r[i - 1][x] + (y == 0));
        }
    }
    int S = 0;
    int v = n / 2;

    if (l[n][0] > v)    S = 1;
    if (r[n][0] < v)    S = 1;

    if (l[n][S] > v)    return  cout << "-1",0;
    if (r[n][S] < v)    return  cout << "-1",0;

    string res = "";

    for(int i = n ; i >= 1 ; --i)   {
        if (S == 0) res += 'A', --v;
        if (S == 1) res += 'B';

        for(int x = 0 ; x < 2 ; ++x)    if (a[i - 1][x] <= a[i][S]) {
            if (l[i - 1][x] > v)    continue;
            if (r[i - 1][x] < v)    continue;

            S = x;
            break;
        }
    }

    reverse(all(res));

    cout << res << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 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 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 540 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 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 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 640 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 6 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 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 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 540 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 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 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 640 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 6 ms 512 KB Output is correct
34 Correct 297 ms 24312 KB Output is correct
35 Correct 303 ms 24240 KB Output is correct
36 Correct 302 ms 23856 KB Output is correct
37 Correct 289 ms 24240 KB Output is correct
38 Correct 287 ms 24240 KB Output is correct
39 Correct 281 ms 25908 KB Output is correct
40 Correct 308 ms 27408 KB Output is correct
41 Correct 284 ms 24752 KB Output is correct
42 Correct 303 ms 26776 KB Output is correct
43 Correct 322 ms 26092 KB Output is correct
44 Correct 320 ms 26092 KB Output is correct
45 Correct 330 ms 26092 KB Output is correct
46 Correct 294 ms 25964 KB Output is correct
47 Correct 292 ms 25964 KB Output is correct
48 Correct 311 ms 25964 KB Output is correct
49 Correct 303 ms 25964 KB Output is correct
50 Correct 301 ms 27500 KB Output is correct
51 Correct 310 ms 27500 KB Output is correct
52 Correct 180 ms 26732 KB Output is correct
53 Correct 177 ms 26732 KB Output is correct
54 Correct 166 ms 26732 KB Output is correct
55 Correct 178 ms 26732 KB Output is correct
56 Correct 307 ms 26860 KB Output is correct
57 Correct 260 ms 26476 KB Output is correct
58 Correct 264 ms 26732 KB Output is correct
59 Correct 270 ms 26732 KB Output is correct
60 Correct 245 ms 25008 KB Output is correct
61 Correct 255 ms 26604 KB Output is correct
62 Correct 256 ms 26288 KB Output is correct
63 Correct 273 ms 26732 KB Output is correct
64 Correct 243 ms 25776 KB Output is correct
65 Correct 268 ms 26604 KB Output is correct