oj.uz

Submission #932606

# Submission time Handle Problem Language Result Execution time Memory
932606 2024-02-23T21:31:25 Z AdamGS Building 4 (JOI20_building4) C++17
100 / 100
 188 ms 45652 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll LIM=1e6+7;
ll T[LIM][2], jaki[LIM], czy[LIM];
int co(int x) {
  if(jaki[x]) return -1;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  ll n;
  cin >> n; n*=2;
  rep(i, n) {
    cin >> T[i][0];
    T[i][0]*=2*n;
    T[i][0]+=(ll)(2*i);
  }
  rep(i, n) {
    cin >> T[i][1];
    T[i][1]*=2*n;
    T[i][1]+=(ll)(2*i+1);
  }
  ll lst=0, sum=0;
  rep(i, n) {
    if(T[i][0]<T[i][1]) {
      if(lst<T[i][0]) {
        lst=T[i][0];
      } else if(lst<T[i][1]) {
        lst=T[i][1];
        jaki[i]=1;
      } else {
        cout << -1 << '\n';
        return 0;
      }
    } else {
      if(lst<T[i][1]) {
        lst=T[i][1];
        jaki[i]=1;
      } else if(lst<T[i][0]) {
        lst=T[i][0];
      } else {
        cout << -1 << '\n';
        return 0;
      }
    }
    sum+=co(i);
  }
  int p=n-1, bil=0;
  for(int i=n-1; i>=0; --i) {
    if(T[i][jaki[i]]>T[i][jaki[i]^1] || (i<n-1 && T[i][jaki[i]^1]>max(T[i+1][0], T[i+1][1]))) {
      p=i-1; bil=0;
      continue;
    }
    if(i<n-1 && p==i && T[i][jaki[i]^1]>T[i+1][jaki[i+1]]) {
      p=i-1; bil=0;
      continue;
    }
    if(i==n-1 || T[i][jaki[i]^1]<T[i+1][jaki[i+1]]) {
      p=i; bil=0;
    }
    bil+=co(i);
    if(abs(sum-2*bil)<abs(sum)) {
      sum-=2*bil;
      for(int j=i; j<=p; ++j) jaki[j]^=1;
      p=i-1; bil=0;
    }
  }
  if(sum!=0) {
    cout << -1 << '\n';
    return 0;
  }
  rep(i, n) cout << (jaki[i]?"B":"A");
  cout << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2516 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4580 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 4648 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 4596 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 4572 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2560 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 148 ms 38000 KB Output is correct
35 Correct 166 ms 42736 KB Output is correct
36 Correct 162 ms 41924 KB Output is correct
37 Correct 169 ms 43972 KB Output is correct
38 Correct 162 ms 43860 KB Output is correct
39 Correct 161 ms 43088 KB Output is correct
40 Correct 180 ms 43892 KB Output is correct
41 Correct 160 ms 43496 KB Output is correct
42 Correct 166 ms 44628 KB Output is correct
43 Correct 179 ms 45652 KB Output is correct
44 Correct 188 ms 44096 KB Output is correct
45 Correct 177 ms 44104 KB Output is correct
46 Correct 171 ms 44176 KB Output is correct
47 Correct 168 ms 44748 KB Output is correct
48 Correct 171 ms 44892 KB Output is correct
49 Correct 172 ms 45392 KB Output is correct
50 Correct 179 ms 43232 KB Output is correct
51 Correct 181 ms 43348 KB Output is correct
52 Correct 123 ms 32336 KB Output is correct
53 Correct 123 ms 33876 KB Output is correct
54 Correct 116 ms 32308 KB Output is correct
55 Correct 118 ms 32036 KB Output is correct
56 Correct 170 ms 45600 KB Output is correct
57 Correct 145 ms 37460 KB Output is correct
58 Correct 154 ms 37712 KB Output is correct
59 Correct 153 ms 35412 KB Output is correct
60 Correct 139 ms 35572 KB Output is correct
61 Correct 149 ms 36944 KB Output is correct
62 Correct 148 ms 36680 KB Output is correct
63 Correct 147 ms 37204 KB Output is correct
64 Correct 143 ms 36152 KB Output is correct
65 Correct 153 ms 37072 KB Output is correct