oj.uz

Submission #119921

# Submission time Handle Problem Language Result Execution time Memory
119921 2019-06-22T15:55:50 Z Milki Alternating Current (BOI18_alternating) C++14
100 / 100
 175 ms 18912 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 2e5 + 5, off = 1 << 18;

struct event{
  int x = -1, y = -1, id = -1;
  event(){}
  event(int x, int y, int id) : x(x), y(y), id(id) {}

  friend bool operator < (const event &A, const event &B){
    if(A.x != B.x) return A.x < B.x;
    return A.y > B.y;
  }
};

int n, m, par[MAXN];
event rail[MAXN];
vector <event> v, ev;
vector <int> djeca[MAXN];
bool sol[MAXN];

struct Tournament{
  int t[2 * off], p[2 * off];

  Tournament(){}
  void reset(){
    memset(t, 0, sizeof(t));
    memset(p, -1, sizeof(p));
  }
  void prop(int x, int lo, int hi){
    if(p[x] == -1)
      return;
    t[x] = p[x] * (hi - lo);
    if(x < off){
      p[x * 2] = p[x];
      p[x * 2 + 1] = p[x];
    }
    p[x] = -1;
  }
  void update(int x, int lo, int hi, int a, int b, int val){
    prop(x, lo, hi);
    if(lo >= b || hi <= a) return;
    if(lo >= a && hi <= b) { p[x] = val; prop(x, lo, hi); return; }
    int mid = (lo + hi) >> 1;
    update(x * 2, lo, mid, a, b, val); update(x * 2 + 1, mid, hi, a, b, val);
    t[x] = t[x * 2] + t[x * 2 + 1];
  }
  int get(int x, int lo, int hi, int a, int b){
    prop(x, lo, hi);
    if(lo >= b || hi <= a) return 0;
    if(lo >= a && hi <= b) return t[x];
    int mid = (lo + hi) >> 1;
    return get(x * 2, lo, mid, a, b) +
           get(x * 2 + 1, mid, hi, a, b);
  }

} T;

bool check(int x){
  T.reset();
  REP(i, m){
    if(sol[i] == x){
      if(rail[i].x > rail[i].y){
        T.update(1, 0, off, rail[i].x, n + 1, 1);
        T.update(1, 0, off, 1, rail[i].y + 1, 1);
      }
      else{
        T.update(1, 0, off, rail[i].x, rail[i].y + 1, 1);
      }
    }
  }

  if(T.get(1, 0, off, 1, n + 1) == n)
    return true;
  else
    return false;
}

void ubaci(int x, int y){
  if(x > y){
    T.update(1, 0, off, x, n + 1, 1);
    T.update(1, 0, off, 1, y + 1, 1);
  }
  else{
    T.update(1, 0, off, x, y + 1, 1);
  }
}

void izbaci(int x, int y){
  if(x > y){
    T.update(1, 0, off, x, n + 1, 0);
    T.update(1, 0, off, 1, y + 1, 0);
  }
  else{
    T.update(1, 0, off, x, y + 1, 0);
  }
}

bool provjeri(event A){
  if(A.x > A.y){
    if(T.get(1, 0, off, A.x, n + 1) != n - A.x + 1)
      return false;
    if(T.get(1, 0, off, 1, A.y + 1) != A.y)
      return false;
  }
  else{
    if(T.get(1, 0, off, A.x, A.y + 1) != A.y - A.x + 1)
      return false;
  }
  return true;
}

bool moze(event A, event B, event C, event D){
  // A i B moraju bit pokriveni sa C i D
  ubaci(C.x, C.y); ubaci(D.x, D.y);

  for(auto it : djeca[A.id])
    ubaci(rail[it].x, rail[it].y);
  for(auto it : djeca[B.id])
    ubaci(rail[it].x, rail[it].y);

  bool ret;
  if(provjeri(A) && provjeri(B))
    ret = true;
  else
    ret = false;

  izbaci(C.x, C.y); izbaci(D.x, D.y);
  for(auto it : djeca[A.id])
    izbaci(rail[it].x, rail[it].y);
  for(auto it : djeca[B.id])
    izbaci(rail[it].x, rail[it].y);
  return ret;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  memset(par, -1, sizeof(par));

  cin >> n >> m;
  REP(i, m){
    int a, b; cin >> a >> b;
    rail[i] = event(a, b, i);

    if(a <= b)
      v.pb(event(a, b, i));
    if(a > b)
      v.pb(event(a, b + n, i));
    else
      v.pb(event(a + n, b + n, i));
  }
  sort(v.begin(), v.end());

  event curr = v[0];
  FOR(i, 1, sz(v)){
    if(curr.x <= v[i].x && curr.y >= v[i].y){
      par[ v[i].id ] = curr.id;
    }

    if(curr.y < v[i].y)
      curr = v[i];
  }

  REP(i, m)
    if(par[i] == i || par[i] == -1)
      ev.pb(rail[i]);
  sort(ev.begin(), ev.end());
  T.reset();

  for(int i = 0; i < sz(ev); i += 2)
    sol[ ev[i].id ] = true;
  REP(i, m){
    if(par[i] != i && par[i] != -1){
      djeca[ par[i] ].pb(i);
      sol[i] = !sol[ par[i] ] ;
    }
  }
  if(sz(ev) % 2 == 0){
    if(check(0) && check(1))
      REP(i, m)
        cout << sol[i];
    else{
      cout << "impossible";
    }
  }
  else{
    REP(i, m)
      sol[i] = 0;

    REP(i, sz(ev)){
      if(moze( ev[(i + 1) % sz(ev)], ev[(i + 2) % sz(ev)], ev[(i) % sz(ev)], ev[(i + 3) % sz(ev)] )){

        for(int j = (i + 1) % sz(ev); j >= 0; j -= 2)
          sol[ ev[j].id ] = 1;
        for(int j = (i + 2) % sz(ev); j < sz(ev); j += 2)
          sol[ ev[j].id ] = 1;

        REP(j, m)
          if(par[j] != j && par[j] != -1)
            sol[j] = !sol[par[j]];

        if(check(0) && check(1))
          REP(j, m)
            cout << sol[j];
        else
          cout << "impossible";
        return 0;
      }
    }
    cout << "impossible";
  }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12288 KB Output is correct
2 Correct 11 ms 12288 KB Output is correct
3 Correct 11 ms 12288 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12288 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 12 ms 12312 KB Output is correct
10 Correct 12 ms 12416 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 13 ms 12288 KB Output is correct
13 Correct 13 ms 12288 KB Output is correct
14 Correct 13 ms 12288 KB Output is correct
15 Correct 13 ms 12416 KB Output is correct
16 Correct 12 ms 12288 KB Output is correct
17 Correct 12 ms 12404 KB Output is correct
18 Correct 13 ms 12288 KB Output is correct
19 Correct 12 ms 12288 KB Output is correct
20 Correct 23 ms 12288 KB Output is correct
21 Correct 12 ms 12288 KB Output is correct
22 Correct 13 ms 12304 KB Output is correct
23 Correct 12 ms 12288 KB Output is correct
24 Correct 12 ms 12288 KB Output is correct
25 Correct 12 ms 12288 KB Output is correct
26 Correct 12 ms 12288 KB Output is correct
27 Correct 12 ms 12208 KB Output is correct
28 Correct 12 ms 12288 KB Output is correct
29 Correct 13 ms 12260 KB Output is correct
30 Correct 11 ms 12288 KB Output is correct
31 Correct 12 ms 12288 KB Output is correct
32 Correct 12 ms 12288 KB Output is correct
33 Correct 13 ms 12324 KB Output is correct
34 Correct 11 ms 12288 KB Output is correct
35 Correct 13 ms 12288 KB Output is correct
36 Correct 12 ms 12288 KB Output is correct
37 Correct 12 ms 12284 KB Output is correct
38 Correct 12 ms 12288 KB Output is correct
39 Correct 13 ms 12416 KB Output is correct
40 Correct 12 ms 12288 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12288 KB Output is correct
2 Correct 11 ms 12288 KB Output is correct
3 Correct 11 ms 12288 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12288 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 12 ms 12312 KB Output is correct
10 Correct 12 ms 12416 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 13 ms 12288 KB Output is correct
13 Correct 13 ms 12288 KB Output is correct
14 Correct 13 ms 12288 KB Output is correct
15 Correct 13 ms 12416 KB Output is correct
16 Correct 12 ms 12288 KB Output is correct
17 Correct 12 ms 12404 KB Output is correct
18 Correct 13 ms 12288 KB Output is correct
19 Correct 12 ms 12288 KB Output is correct
20 Correct 23 ms 12288 KB Output is correct
21 Correct 12 ms 12288 KB Output is correct
22 Correct 13 ms 12304 KB Output is correct
23 Correct 12 ms 12288 KB Output is correct
24 Correct 12 ms 12288 KB Output is correct
25 Correct 12 ms 12288 KB Output is correct
26 Correct 12 ms 12288 KB Output is correct
27 Correct 12 ms 12208 KB Output is correct
28 Correct 12 ms 12288 KB Output is correct
29 Correct 13 ms 12260 KB Output is correct
30 Correct 11 ms 12288 KB Output is correct
31 Correct 12 ms 12288 KB Output is correct
32 Correct 12 ms 12288 KB Output is correct
33 Correct 13 ms 12324 KB Output is correct
34 Correct 11 ms 12288 KB Output is correct
35 Correct 13 ms 12288 KB Output is correct
36 Correct 12 ms 12288 KB Output is correct
37 Correct 12 ms 12284 KB Output is correct
38 Correct 12 ms 12288 KB Output is correct
39 Correct 13 ms 12416 KB Output is correct
40 Correct 12 ms 12288 KB Output is correct
41 Correct 12 ms 12288 KB Output is correct
42 Correct 12 ms 12288 KB Output is correct
43 Correct 13 ms 12288 KB Output is correct
44 Correct 12 ms 12288 KB Output is correct
45 Correct 12 ms 12288 KB Output is correct
46 Correct 13 ms 12288 KB Output is correct
47 Correct 13 ms 12288 KB Output is correct
48 Correct 12 ms 12288 KB Output is correct
49 Correct 12 ms 12208 KB Output is correct
50 Correct 12 ms 12288 KB Output is correct
51 Correct 12 ms 12320 KB Output is correct
52 Correct 12 ms 12288 KB Output is correct
53 Correct 12 ms 12288 KB Output is correct
54 Correct 13 ms 12288 KB Output is correct
55 Correct 12 ms 12288 KB Output is correct
56 Correct 12 ms 12288 KB Output is correct
57 Correct 13 ms 12288 KB Output is correct
58 Correct 12 ms 12288 KB Output is correct
59 Correct 12 ms 12288 KB Output is correct
60 Correct 12 ms 12288 KB Output is correct
61 Correct 11 ms 12288 KB Output is correct
62 Correct 12 ms 12288 KB Output is correct
63 Correct 12 ms 12288 KB Output is correct
64 Correct 12 ms 12288 KB Output is correct
65 Correct 12 ms 12288 KB Output is correct
66 Correct 12 ms 12288 KB Output is correct
67 Correct 12 ms 12288 KB Output is correct
68 Correct 12 ms 12288 KB Output is correct
69 Correct 12 ms 12288 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12288 KB Output is correct
2 Correct 11 ms 12288 KB Output is correct
3 Correct 11 ms 12288 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12288 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 12 ms 12312 KB Output is correct
10 Correct 12 ms 12416 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 13 ms 12288 KB Output is correct
13 Correct 13 ms 12288 KB Output is correct
14 Correct 13 ms 12288 KB Output is correct
15 Correct 13 ms 12416 KB Output is correct
16 Correct 12 ms 12288 KB Output is correct
17 Correct 12 ms 12404 KB Output is correct
18 Correct 13 ms 12288 KB Output is correct
19 Correct 12 ms 12288 KB Output is correct
20 Correct 23 ms 12288 KB Output is correct
21 Correct 12 ms 12288 KB Output is correct
22 Correct 13 ms 12304 KB Output is correct
23 Correct 12 ms 12288 KB Output is correct
24 Correct 12 ms 12288 KB Output is correct
25 Correct 12 ms 12288 KB Output is correct
26 Correct 12 ms 12288 KB Output is correct
27 Correct 12 ms 12208 KB Output is correct
28 Correct 12 ms 12288 KB Output is correct
29 Correct 13 ms 12260 KB Output is correct
30 Correct 11 ms 12288 KB Output is correct
31 Correct 12 ms 12288 KB Output is correct
32 Correct 12 ms 12288 KB Output is correct
33 Correct 13 ms 12324 KB Output is correct
34 Correct 11 ms 12288 KB Output is correct
35 Correct 13 ms 12288 KB Output is correct
36 Correct 12 ms 12288 KB Output is correct
37 Correct 12 ms 12284 KB Output is correct
38 Correct 12 ms 12288 KB Output is correct
39 Correct 13 ms 12416 KB Output is correct
40 Correct 12 ms 12288 KB Output is correct
41 Correct 12 ms 12288 KB Output is correct
42 Correct 12 ms 12288 KB Output is correct
43 Correct 13 ms 12288 KB Output is correct
44 Correct 12 ms 12288 KB Output is correct
45 Correct 12 ms 12288 KB Output is correct
46 Correct 13 ms 12288 KB Output is correct
47 Correct 13 ms 12288 KB Output is correct
48 Correct 12 ms 12288 KB Output is correct
49 Correct 12 ms 12208 KB Output is correct
50 Correct 12 ms 12288 KB Output is correct
51 Correct 12 ms 12320 KB Output is correct
52 Correct 12 ms 12288 KB Output is correct
53 Correct 12 ms 12288 KB Output is correct
54 Correct 13 ms 12288 KB Output is correct
55 Correct 12 ms 12288 KB Output is correct
56 Correct 12 ms 12288 KB Output is correct
57 Correct 13 ms 12288 KB Output is correct
58 Correct 12 ms 12288 KB Output is correct
59 Correct 12 ms 12288 KB Output is correct
60 Correct 12 ms 12288 KB Output is correct
61 Correct 11 ms 12288 KB Output is correct
62 Correct 12 ms 12288 KB Output is correct
63 Correct 12 ms 12288 KB Output is correct
64 Correct 12 ms 12288 KB Output is correct
65 Correct 12 ms 12288 KB Output is correct
66 Correct 12 ms 12288 KB Output is correct
67 Correct 12 ms 12288 KB Output is correct
68 Correct 12 ms 12288 KB Output is correct
69 Correct 12 ms 12288 KB Output is correct
70 Correct 12 ms 12416 KB Output is correct
71 Correct 13 ms 12416 KB Output is correct
72 Correct 12 ms 12288 KB Output is correct
73 Correct 12 ms 12416 KB Output is correct
74 Correct 12 ms 12288 KB Output is correct
75 Correct 12 ms 12288 KB Output is correct
76 Correct 13 ms 12288 KB Output is correct
77 Correct 13 ms 12288 KB Output is correct
78 Correct 12 ms 12288 KB Output is correct
79 Correct 23 ms 12288 KB Output is correct
80 Correct 13 ms 12416 KB Output is correct
81 Correct 13 ms 12288 KB Output is correct
82 Correct 13 ms 12288 KB Output is correct
83 Correct 13 ms 12288 KB Output is correct
84 Correct 13 ms 12416 KB Output is correct
85 Correct 13 ms 12288 KB Output is correct
86 Correct 12 ms 12288 KB Output is correct
87 Correct 20 ms 12416 KB Output is correct
88 Correct 13 ms 12288 KB Output is correct
89 Correct 13 ms 12288 KB Output is correct
90 Correct 13 ms 12288 KB Output is correct
91 Correct 13 ms 12288 KB Output is correct
92 Correct 14 ms 12464 KB Output is correct
93 Correct 13 ms 12316 KB Output is correct
94 Correct 12 ms 12288 KB Output is correct
95 Correct 13 ms 12288 KB Output is correct
96 Correct 14 ms 12288 KB Output is correct
97 Correct 19 ms 12288 KB Output is correct
98 Correct 13 ms 12416 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 16568 KB Output is correct
2 Correct 12 ms 12288 KB Output is correct
3 Correct 104 ms 14580 KB Output is correct
4 Correct 109 ms 14612 KB Output is correct
5 Correct 102 ms 17380 KB Output is correct
6 Correct 95 ms 16992 KB Output is correct
7 Correct 81 ms 16356 KB Output is correct
8 Correct 15 ms 12416 KB Output is correct
9 Correct 13 ms 12288 KB Output is correct
10 Correct 99 ms 17760 KB Output is correct
11 Correct 77 ms 15868 KB Output is correct
12 Correct 155 ms 16480 KB Output is correct
13 Correct 14 ms 12288 KB Output is correct
14 Correct 12 ms 12288 KB Output is correct
15 Correct 175 ms 16868 KB Output is correct
16 Correct 39 ms 15596 KB Output is correct
17 Correct 122 ms 16612 KB Output is correct
18 Correct 95 ms 16612 KB Output is correct
19 Correct 14 ms 12608 KB Output is correct
20 Correct 84 ms 18912 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12288 KB Output is correct
2 Correct 11 ms 12288 KB Output is correct
3 Correct 11 ms 12288 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12288 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 12 ms 12312 KB Output is correct
10 Correct 12 ms 12416 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 13 ms 12288 KB Output is correct
13 Correct 13 ms 12288 KB Output is correct
14 Correct 13 ms 12288 KB Output is correct
15 Correct 13 ms 12416 KB Output is correct
16 Correct 12 ms 12288 KB Output is correct
17 Correct 12 ms 12404 KB Output is correct
18 Correct 13 ms 12288 KB Output is correct
19 Correct 12 ms 12288 KB Output is correct
20 Correct 23 ms 12288 KB Output is correct
21 Correct 12 ms 12288 KB Output is correct
22 Correct 13 ms 12304 KB Output is correct
23 Correct 12 ms 12288 KB Output is correct
24 Correct 12 ms 12288 KB Output is correct
25 Correct 12 ms 12288 KB Output is correct
26 Correct 12 ms 12288 KB Output is correct
27 Correct 12 ms 12208 KB Output is correct
28 Correct 12 ms 12288 KB Output is correct
29 Correct 13 ms 12260 KB Output is correct
30 Correct 11 ms 12288 KB Output is correct
31 Correct 12 ms 12288 KB Output is correct
32 Correct 12 ms 12288 KB Output is correct
33 Correct 13 ms 12324 KB Output is correct
34 Correct 11 ms 12288 KB Output is correct
35 Correct 13 ms 12288 KB Output is correct
36 Correct 12 ms 12288 KB Output is correct
37 Correct 12 ms 12284 KB Output is correct
38 Correct 12 ms 12288 KB Output is correct
39 Correct 13 ms 12416 KB Output is correct
40 Correct 12 ms 12288 KB Output is correct
41 Correct 12 ms 12288 KB Output is correct
42 Correct 12 ms 12288 KB Output is correct
43 Correct 13 ms 12288 KB Output is correct
44 Correct 12 ms 12288 KB Output is correct
45 Correct 12 ms 12288 KB Output is correct
46 Correct 13 ms 12288 KB Output is correct
47 Correct 13 ms 12288 KB Output is correct
48 Correct 12 ms 12288 KB Output is correct
49 Correct 12 ms 12208 KB Output is correct
50 Correct 12 ms 12288 KB Output is correct
51 Correct 12 ms 12320 KB Output is correct
52 Correct 12 ms 12288 KB Output is correct
53 Correct 12 ms 12288 KB Output is correct
54 Correct 13 ms 12288 KB Output is correct
55 Correct 12 ms 12288 KB Output is correct
56 Correct 12 ms 12288 KB Output is correct
57 Correct 13 ms 12288 KB Output is correct
58 Correct 12 ms 12288 KB Output is correct
59 Correct 12 ms 12288 KB Output is correct
60 Correct 12 ms 12288 KB Output is correct
61 Correct 11 ms 12288 KB Output is correct
62 Correct 12 ms 12288 KB Output is correct
63 Correct 12 ms 12288 KB Output is correct
64 Correct 12 ms 12288 KB Output is correct
65 Correct 12 ms 12288 KB Output is correct
66 Correct 12 ms 12288 KB Output is correct
67 Correct 12 ms 12288 KB Output is correct
68 Correct 12 ms 12288 KB Output is correct
69 Correct 12 ms 12288 KB Output is correct
70 Correct 12 ms 12416 KB Output is correct
71 Correct 13 ms 12416 KB Output is correct
72 Correct 12 ms 12288 KB Output is correct
73 Correct 12 ms 12416 KB Output is correct
74 Correct 12 ms 12288 KB Output is correct
75 Correct 12 ms 12288 KB Output is correct
76 Correct 13 ms 12288 KB Output is correct
77 Correct 13 ms 12288 KB Output is correct
78 Correct 12 ms 12288 KB Output is correct
79 Correct 23 ms 12288 KB Output is correct
80 Correct 13 ms 12416 KB Output is correct
81 Correct 13 ms 12288 KB Output is correct
82 Correct 13 ms 12288 KB Output is correct
83 Correct 13 ms 12288 KB Output is correct
84 Correct 13 ms 12416 KB Output is correct
85 Correct 13 ms 12288 KB Output is correct
86 Correct 12 ms 12288 KB Output is correct
87 Correct 20 ms 12416 KB Output is correct
88 Correct 13 ms 12288 KB Output is correct
89 Correct 13 ms 12288 KB Output is correct
90 Correct 13 ms 12288 KB Output is correct
91 Correct 13 ms 12288 KB Output is correct
92 Correct 14 ms 12464 KB Output is correct
93 Correct 13 ms 12316 KB Output is correct
94 Correct 12 ms 12288 KB Output is correct
95 Correct 13 ms 12288 KB Output is correct
96 Correct 14 ms 12288 KB Output is correct
97 Correct 19 ms 12288 KB Output is correct
98 Correct 13 ms 12416 KB Output is correct
99 Correct 80 ms 16568 KB Output is correct
100 Correct 12 ms 12288 KB Output is correct
101 Correct 104 ms 14580 KB Output is correct
102 Correct 109 ms 14612 KB Output is correct
103 Correct 102 ms 17380 KB Output is correct
104 Correct 95 ms 16992 KB Output is correct
105 Correct 81 ms 16356 KB Output is correct
106 Correct 15 ms 12416 KB Output is correct
107 Correct 13 ms 12288 KB Output is correct
108 Correct 99 ms 17760 KB Output is correct
109 Correct 77 ms 15868 KB Output is correct
110 Correct 155 ms 16480 KB Output is correct
111 Correct 14 ms 12288 KB Output is correct
112 Correct 12 ms 12288 KB Output is correct
113 Correct 175 ms 16868 KB Output is correct
114 Correct 39 ms 15596 KB Output is correct
115 Correct 122 ms 16612 KB Output is correct
116 Correct 95 ms 16612 KB Output is correct
117 Correct 14 ms 12608 KB Output is correct
118 Correct 84 ms 18912 KB Output is correct
119 Correct 12 ms 12288 KB Output is correct
120 Correct 138 ms 17384 KB Output is correct
121 Correct 66 ms 15336 KB Output is correct
122 Correct 12 ms 12288 KB Output is correct
123 Correct 16 ms 12580 KB Output is correct
124 Correct 35 ms 14196 KB Output is correct
125 Correct 34 ms 13808 KB Output is correct
126 Correct 12 ms 12288 KB Output is correct
127 Correct 19 ms 12796 KB Output is correct
128 Correct 81 ms 16536 KB Output is correct
129 Correct 47 ms 14444 KB Output is correct
130 Correct 57 ms 15212 KB Output is correct
131 Correct 12 ms 12288 KB Output is correct
132 Correct 12 ms 12288 KB Output is correct
133 Correct 130 ms 15972 KB Output is correct
134 Correct 46 ms 13484 KB Output is correct
135 Correct 13 ms 12288 KB Output is correct
136 Correct 54 ms 15592 KB Output is correct
137 Correct 67 ms 15976 KB Output is correct
138 Correct 14 ms 12416 KB Output is correct