oj.uz

Submission #749681

# Submission time Handle Problem Language Result Execution time Memory
749681 2023-05-28T11:22:32 Z anhduc2701 Alternating Current (BOI18_alternating) C++17
100 / 100
 183 ms 112944 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI acos(-1.0)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x, i) (1 & ((x) >> (i)))
#define MASK(x) (1LL << (x))
#define task "tnc"
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef long double ld;
const ll INF = 1e18;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const int mo = 998244353;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using pii = pair<pair<ll, ll>, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct seg
{
    int l, r, id;
    seg() {}
    seg(int _l, int _r, int _id)
    {
        l = _l;
        r = _r;
        id = _id;
    }
} A[maxn];
int pref[maxn];
vector<int> G[maxn];
int n, m;
int pref1[maxn];
vector<int> sus[maxn];
int col[maxn];
int ch = 0;
void dfs(int u)
{
    for (auto v : G[u])
    {
        if (col[v] == -1)
        {
            col[v] = col[u] ^ 1;
            dfs(v);
        }
        else if (col[v] != col[u] ^ 1)
        {
            ch = 1;
        }
    }
}
int pref2[maxn];
vector<pair<int, int>> st[maxn];
vector<int> era[maxn];
int pref3[maxn];
int pref4[maxn];
signed main()
{
    cin.tie(0), cout.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int l, r;
        cin >> l >> r;
        st[l].pb({r, i});
        pref[l]++;
        pref[r + 1]--;
        if (l > r)
            pref[1]++;
        A[i] = seg(l, r, i);
    }
    vector<int> check;
    for (int i = 1; i <= n; i++)
    {
        pref[i] += pref[i - 1];
        pref1[i] = pref1[i - 1];
        if (pref[i] == 2)
        {
            check.pb(i);
            pref1[i]++;
        }
        if (pref[i] <= 1)
        {
            cout << "impossible\n";
            return 0;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (A[i].l <= A[i].r)
        {
            if (pref1[A[i].r] - pref1[A[i].l - 1] > 0)
            {
                int v = lower_bound(check.begin(), check.end(), A[i].l) - check.begin();
                while (v < check.size() && check[v] <= A[i].r)
                {
                    sus[check[v]].pb(i);
                    v++;
                }
            }
        }
        else
        {
            int v = lower_bound(check.begin(), check.end(), A[i].l) - check.begin();
            while (v < check.size())
            {
                sus[check[v]].pb(i);
                v++;
            }
            v = lower_bound(check.begin(), check.end(), 1) - check.begin();
            while (v < check.size() && check[v] <= A[i].r)
            {
                sus[check[v]].pb(i);
                v++;
            }
        }
    }

    for (auto v : check)
    {
        G[sus[v][0]].pb(sus[v][1]);
        G[sus[v][1]].pb(sus[v][0]);
    }
    memset(col, -1, sizeof(col));
    for (int i = 1; i <= m; i++)
    {
        if (G[i].size() && col[i] == -1)
        {
            col[i] = 0;
            dfs(i);
        }
    }
    if (ch == 1)
    {
        cout << "impossible\n";
        return 0;
    }
    set<pair<int, int>> pq;
    for (int i = 1; i <= m; i++)
    {
        if (col[i] == 1)
        {
            pref2[A[i].l]++;
            pref2[A[i].r + 1]--;
            if (A[i].l > A[i].r)
                pref2[1]++;
        }
        if (col[i] == -1 && A[i].l > A[i].r)
        {
            pq.insert({A[i].r, i});
            era[A[i].r + 1].pb(i);
        }
    }
    for (int i = 1; i <= n; i++)
    {
        pref2[i] += pref2[i - 1];

        int id = 0;
        int r = 0;
        for (auto v : era[i])
        {
            if (pq.find({i, v}) != pq.end())
            {
                pq.erase({i, v});
            }
        }
        for (auto v : st[i])
        {
            if (col[v.se] == -1)
            {

                if (i > v.fi)
                {
                    pq.insert({v.fi + n, v.se});
                }
                else
                {
                    pq.insert({v.fi, v.se});
                    era[v.fi + 1].pb(v.se);
                }
            }
        }
        if (pref2[i] == 0)
        {
            int id = (*pq.rbegin()).se;
            int r = (*pq.rbegin()).fi;
            pq.erase({r, id});
            col[id] = 1;
            pref2[i + 1]++;
            pref2[r + 1]--;
            if (A[id].l > A[id].r)
            {
                pref2[A[id].l]++;
            }
        }
    }
    for (int i = 1; i <= m; i++)
    {
        if (col[i] == 1)
        {
            cout << 1;
        }
        else
        {
            cout << 0;
        }
    }
}

Compilation message

alternating.cpp: In function 'void dfs(int)':
alternating.cpp:60:25: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   60 |         else if (col[v] != col[u] ^ 1)
      |                  ~~~~~~~^~~~~~~~~
alternating.cpp: In function 'int main()':
alternating.cpp:109:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |                 while (v < check.size() && check[v] <= A[i].r)
      |                        ~~^~~~~~~~~~~~~~
alternating.cpp:119:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |             while (v < check.size())
      |                    ~~^~~~~~~~~~~~~~
alternating.cpp:125:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |             while (v < check.size() && check[v] <= A[i].r)
      |                    ~~^~~~~~~~~~~~~~
alternating.cpp:172:13: warning: unused variable 'id' [-Wunused-variable]
  172 |         int id = 0;
      |             ^~
alternating.cpp:173:13: warning: unused variable 'r' [-Wunused-variable]
  173 |         int r = 0;
      |             ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 98104 KB Output is correct
2 Correct 47 ms 98124 KB Output is correct
3 Correct 50 ms 98100 KB Output is correct
4 Correct 47 ms 98124 KB Output is correct
5 Correct 49 ms 98160 KB Output is correct
6 Correct 47 ms 98172 KB Output is correct
7 Correct 47 ms 98124 KB Output is correct
8 Correct 46 ms 94164 KB Output is correct
9 Correct 47 ms 98124 KB Output is correct
10 Correct 46 ms 94252 KB Output is correct
11 Correct 46 ms 94164 KB Output is correct
12 Correct 47 ms 98096 KB Output is correct
13 Correct 49 ms 94292 KB Output is correct
14 Correct 48 ms 98124 KB Output is correct
15 Correct 48 ms 98176 KB Output is correct
16 Correct 46 ms 98120 KB Output is correct
17 Correct 48 ms 98128 KB Output is correct
18 Correct 46 ms 98192 KB Output is correct
19 Correct 46 ms 98192 KB Output is correct
20 Correct 47 ms 98064 KB Output is correct
21 Correct 47 ms 98108 KB Output is correct
22 Correct 47 ms 98132 KB Output is correct
23 Correct 51 ms 98192 KB Output is correct
24 Correct 47 ms 98112 KB Output is correct
25 Correct 47 ms 98120 KB Output is correct
26 Correct 50 ms 98224 KB Output is correct
27 Correct 47 ms 94208 KB Output is correct
28 Correct 47 ms 98124 KB Output is correct
29 Correct 50 ms 94200 KB Output is correct
30 Correct 47 ms 94160 KB Output is correct
31 Correct 47 ms 98096 KB Output is correct
32 Correct 46 ms 94204 KB Output is correct
33 Correct 47 ms 98084 KB Output is correct
34 Correct 49 ms 94220 KB Output is correct
35 Correct 46 ms 94164 KB Output is correct
36 Correct 49 ms 98192 KB Output is correct
37 Correct 48 ms 98108 KB Output is correct
38 Correct 48 ms 94204 KB Output is correct
39 Correct 48 ms 98148 KB Output is correct
40 Correct 46 ms 98192 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 98104 KB Output is correct
2 Correct 47 ms 98124 KB Output is correct
3 Correct 50 ms 98100 KB Output is correct
4 Correct 47 ms 98124 KB Output is correct
5 Correct 49 ms 98160 KB Output is correct
6 Correct 47 ms 98172 KB Output is correct
7 Correct 47 ms 98124 KB Output is correct
8 Correct 46 ms 94164 KB Output is correct
9 Correct 47 ms 98124 KB Output is correct
10 Correct 46 ms 94252 KB Output is correct
11 Correct 46 ms 94164 KB Output is correct
12 Correct 47 ms 98096 KB Output is correct
13 Correct 49 ms 94292 KB Output is correct
14 Correct 48 ms 98124 KB Output is correct
15 Correct 48 ms 98176 KB Output is correct
16 Correct 46 ms 98120 KB Output is correct
17 Correct 48 ms 98128 KB Output is correct
18 Correct 46 ms 98192 KB Output is correct
19 Correct 46 ms 98192 KB Output is correct
20 Correct 47 ms 98064 KB Output is correct
21 Correct 47 ms 98108 KB Output is correct
22 Correct 47 ms 98132 KB Output is correct
23 Correct 51 ms 98192 KB Output is correct
24 Correct 47 ms 98112 KB Output is correct
25 Correct 47 ms 98120 KB Output is correct
26 Correct 50 ms 98224 KB Output is correct
27 Correct 47 ms 94208 KB Output is correct
28 Correct 47 ms 98124 KB Output is correct
29 Correct 50 ms 94200 KB Output is correct
30 Correct 47 ms 94160 KB Output is correct
31 Correct 47 ms 98096 KB Output is correct
32 Correct 46 ms 94204 KB Output is correct
33 Correct 47 ms 98084 KB Output is correct
34 Correct 49 ms 94220 KB Output is correct
35 Correct 46 ms 94164 KB Output is correct
36 Correct 49 ms 98192 KB Output is correct
37 Correct 48 ms 98108 KB Output is correct
38 Correct 48 ms 94204 KB Output is correct
39 Correct 48 ms 98148 KB Output is correct
40 Correct 46 ms 98192 KB Output is correct
41 Correct 47 ms 98152 KB Output is correct
42 Correct 46 ms 98128 KB Output is correct
43 Correct 49 ms 98124 KB Output is correct
44 Correct 47 ms 98116 KB Output is correct
45 Correct 47 ms 98088 KB Output is correct
46 Correct 48 ms 98192 KB Output is correct
47 Correct 48 ms 98096 KB Output is correct
48 Correct 50 ms 94156 KB Output is correct
49 Correct 53 ms 98124 KB Output is correct
50 Correct 46 ms 94280 KB Output is correct
51 Correct 53 ms 94172 KB Output is correct
52 Correct 45 ms 94276 KB Output is correct
53 Correct 46 ms 94156 KB Output is correct
54 Correct 47 ms 98196 KB Output is correct
55 Correct 47 ms 98124 KB Output is correct
56 Correct 48 ms 98124 KB Output is correct
57 Correct 47 ms 98096 KB Output is correct
58 Correct 47 ms 98204 KB Output is correct
59 Correct 47 ms 98104 KB Output is correct
60 Correct 48 ms 98124 KB Output is correct
61 Correct 47 ms 98120 KB Output is correct
62 Correct 45 ms 94156 KB Output is correct
63 Correct 45 ms 94192 KB Output is correct
64 Correct 49 ms 98104 KB Output is correct
65 Correct 47 ms 94156 KB Output is correct
66 Correct 48 ms 98124 KB Output is correct
67 Correct 48 ms 98196 KB Output is correct
68 Correct 55 ms 98188 KB Output is correct
69 Correct 48 ms 98092 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 98104 KB Output is correct
2 Correct 47 ms 98124 KB Output is correct
3 Correct 50 ms 98100 KB Output is correct
4 Correct 47 ms 98124 KB Output is correct
5 Correct 49 ms 98160 KB Output is correct
6 Correct 47 ms 98172 KB Output is correct
7 Correct 47 ms 98124 KB Output is correct
8 Correct 46 ms 94164 KB Output is correct
9 Correct 47 ms 98124 KB Output is correct
10 Correct 46 ms 94252 KB Output is correct
11 Correct 46 ms 94164 KB Output is correct
12 Correct 47 ms 98096 KB Output is correct
13 Correct 49 ms 94292 KB Output is correct
14 Correct 48 ms 98124 KB Output is correct
15 Correct 48 ms 98176 KB Output is correct
16 Correct 46 ms 98120 KB Output is correct
17 Correct 48 ms 98128 KB Output is correct
18 Correct 46 ms 98192 KB Output is correct
19 Correct 46 ms 98192 KB Output is correct
20 Correct 47 ms 98064 KB Output is correct
21 Correct 47 ms 98108 KB Output is correct
22 Correct 47 ms 98132 KB Output is correct
23 Correct 51 ms 98192 KB Output is correct
24 Correct 47 ms 98112 KB Output is correct
25 Correct 47 ms 98120 KB Output is correct
26 Correct 50 ms 98224 KB Output is correct
27 Correct 47 ms 94208 KB Output is correct
28 Correct 47 ms 98124 KB Output is correct
29 Correct 50 ms 94200 KB Output is correct
30 Correct 47 ms 94160 KB Output is correct
31 Correct 47 ms 98096 KB Output is correct
32 Correct 46 ms 94204 KB Output is correct
33 Correct 47 ms 98084 KB Output is correct
34 Correct 49 ms 94220 KB Output is correct
35 Correct 46 ms 94164 KB Output is correct
36 Correct 49 ms 98192 KB Output is correct
37 Correct 48 ms 98108 KB Output is correct
38 Correct 48 ms 94204 KB Output is correct
39 Correct 48 ms 98148 KB Output is correct
40 Correct 46 ms 98192 KB Output is correct
41 Correct 47 ms 98152 KB Output is correct
42 Correct 46 ms 98128 KB Output is correct
43 Correct 49 ms 98124 KB Output is correct
44 Correct 47 ms 98116 KB Output is correct
45 Correct 47 ms 98088 KB Output is correct
46 Correct 48 ms 98192 KB Output is correct
47 Correct 48 ms 98096 KB Output is correct
48 Correct 50 ms 94156 KB Output is correct
49 Correct 53 ms 98124 KB Output is correct
50 Correct 46 ms 94280 KB Output is correct
51 Correct 53 ms 94172 KB Output is correct
52 Correct 45 ms 94276 KB Output is correct
53 Correct 46 ms 94156 KB Output is correct
54 Correct 47 ms 98196 KB Output is correct
55 Correct 47 ms 98124 KB Output is correct
56 Correct 48 ms 98124 KB Output is correct
57 Correct 47 ms 98096 KB Output is correct
58 Correct 47 ms 98204 KB Output is correct
59 Correct 47 ms 98104 KB Output is correct
60 Correct 48 ms 98124 KB Output is correct
61 Correct 47 ms 98120 KB Output is correct
62 Correct 45 ms 94156 KB Output is correct
63 Correct 45 ms 94192 KB Output is correct
64 Correct 49 ms 98104 KB Output is correct
65 Correct 47 ms 94156 KB Output is correct
66 Correct 48 ms 98124 KB Output is correct
67 Correct 48 ms 98196 KB Output is correct
68 Correct 55 ms 98188 KB Output is correct
69 Correct 48 ms 98092 KB Output is correct
70 Correct 48 ms 98284 KB Output is correct
71 Correct 48 ms 98352 KB Output is correct
72 Correct 49 ms 98192 KB Output is correct
73 Correct 49 ms 98152 KB Output is correct
74 Correct 48 ms 98252 KB Output is correct
75 Correct 48 ms 98184 KB Output is correct
76 Correct 49 ms 94336 KB Output is correct
77 Correct 55 ms 98204 KB Output is correct
78 Correct 48 ms 94272 KB Output is correct
79 Correct 68 ms 94268 KB Output is correct
80 Correct 51 ms 94284 KB Output is correct
81 Correct 51 ms 98256 KB Output is correct
82 Correct 51 ms 98108 KB Output is correct
83 Correct 52 ms 98208 KB Output is correct
84 Correct 54 ms 98220 KB Output is correct
85 Correct 53 ms 98252 KB Output is correct
86 Correct 51 ms 98252 KB Output is correct
87 Correct 51 ms 98300 KB Output is correct
88 Correct 51 ms 98252 KB Output is correct
89 Correct 48 ms 94284 KB Output is correct
90 Correct 51 ms 98340 KB Output is correct
91 Correct 54 ms 98104 KB Output is correct
92 Correct 49 ms 98252 KB Output is correct
93 Correct 50 ms 98160 KB Output is correct
94 Correct 49 ms 94216 KB Output is correct
95 Correct 51 ms 98136 KB Output is correct
96 Correct 50 ms 98252 KB Output is correct
97 Correct 53 ms 98288 KB Output is correct
98 Correct 51 ms 98288 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 107396 KB Output is correct
2 Correct 64 ms 104120 KB Output is correct
3 Correct 62 ms 97380 KB Output is correct
4 Correct 78 ms 106060 KB Output is correct
5 Correct 139 ms 110500 KB Output is correct
6 Correct 78 ms 99372 KB Output is correct
7 Correct 127 ms 110724 KB Output is correct
8 Correct 63 ms 102572 KB Output is correct
9 Correct 60 ms 102028 KB Output is correct
10 Correct 140 ms 110836 KB Output is correct
11 Correct 121 ms 109256 KB Output is correct
12 Correct 128 ms 111120 KB Output is correct
13 Correct 51 ms 95544 KB Output is correct
14 Correct 51 ms 95588 KB Output is correct
15 Correct 113 ms 109108 KB Output is correct
16 Correct 59 ms 97732 KB Output is correct
17 Correct 157 ms 110296 KB Output is correct
18 Correct 130 ms 107084 KB Output is correct
19 Correct 51 ms 94860 KB Output is correct
20 Correct 91 ms 107920 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 98104 KB Output is correct
2 Correct 47 ms 98124 KB Output is correct
3 Correct 50 ms 98100 KB Output is correct
4 Correct 47 ms 98124 KB Output is correct
5 Correct 49 ms 98160 KB Output is correct
6 Correct 47 ms 98172 KB Output is correct
7 Correct 47 ms 98124 KB Output is correct
8 Correct 46 ms 94164 KB Output is correct
9 Correct 47 ms 98124 KB Output is correct
10 Correct 46 ms 94252 KB Output is correct
11 Correct 46 ms 94164 KB Output is correct
12 Correct 47 ms 98096 KB Output is correct
13 Correct 49 ms 94292 KB Output is correct
14 Correct 48 ms 98124 KB Output is correct
15 Correct 48 ms 98176 KB Output is correct
16 Correct 46 ms 98120 KB Output is correct
17 Correct 48 ms 98128 KB Output is correct
18 Correct 46 ms 98192 KB Output is correct
19 Correct 46 ms 98192 KB Output is correct
20 Correct 47 ms 98064 KB Output is correct
21 Correct 47 ms 98108 KB Output is correct
22 Correct 47 ms 98132 KB Output is correct
23 Correct 51 ms 98192 KB Output is correct
24 Correct 47 ms 98112 KB Output is correct
25 Correct 47 ms 98120 KB Output is correct
26 Correct 50 ms 98224 KB Output is correct
27 Correct 47 ms 94208 KB Output is correct
28 Correct 47 ms 98124 KB Output is correct
29 Correct 50 ms 94200 KB Output is correct
30 Correct 47 ms 94160 KB Output is correct
31 Correct 47 ms 98096 KB Output is correct
32 Correct 46 ms 94204 KB Output is correct
33 Correct 47 ms 98084 KB Output is correct
34 Correct 49 ms 94220 KB Output is correct
35 Correct 46 ms 94164 KB Output is correct
36 Correct 49 ms 98192 KB Output is correct
37 Correct 48 ms 98108 KB Output is correct
38 Correct 48 ms 94204 KB Output is correct
39 Correct 48 ms 98148 KB Output is correct
40 Correct 46 ms 98192 KB Output is correct
41 Correct 47 ms 98152 KB Output is correct
42 Correct 46 ms 98128 KB Output is correct
43 Correct 49 ms 98124 KB Output is correct
44 Correct 47 ms 98116 KB Output is correct
45 Correct 47 ms 98088 KB Output is correct
46 Correct 48 ms 98192 KB Output is correct
47 Correct 48 ms 98096 KB Output is correct
48 Correct 50 ms 94156 KB Output is correct
49 Correct 53 ms 98124 KB Output is correct
50 Correct 46 ms 94280 KB Output is correct
51 Correct 53 ms 94172 KB Output is correct
52 Correct 45 ms 94276 KB Output is correct
53 Correct 46 ms 94156 KB Output is correct
54 Correct 47 ms 98196 KB Output is correct
55 Correct 47 ms 98124 KB Output is correct
56 Correct 48 ms 98124 KB Output is correct
57 Correct 47 ms 98096 KB Output is correct
58 Correct 47 ms 98204 KB Output is correct
59 Correct 47 ms 98104 KB Output is correct
60 Correct 48 ms 98124 KB Output is correct
61 Correct 47 ms 98120 KB Output is correct
62 Correct 45 ms 94156 KB Output is correct
63 Correct 45 ms 94192 KB Output is correct
64 Correct 49 ms 98104 KB Output is correct
65 Correct 47 ms 94156 KB Output is correct
66 Correct 48 ms 98124 KB Output is correct
67 Correct 48 ms 98196 KB Output is correct
68 Correct 55 ms 98188 KB Output is correct
69 Correct 48 ms 98092 KB Output is correct
70 Correct 48 ms 98284 KB Output is correct
71 Correct 48 ms 98352 KB Output is correct
72 Correct 49 ms 98192 KB Output is correct
73 Correct 49 ms 98152 KB Output is correct
74 Correct 48 ms 98252 KB Output is correct
75 Correct 48 ms 98184 KB Output is correct
76 Correct 49 ms 94336 KB Output is correct
77 Correct 55 ms 98204 KB Output is correct
78 Correct 48 ms 94272 KB Output is correct
79 Correct 68 ms 94268 KB Output is correct
80 Correct 51 ms 94284 KB Output is correct
81 Correct 51 ms 98256 KB Output is correct
82 Correct 51 ms 98108 KB Output is correct
83 Correct 52 ms 98208 KB Output is correct
84 Correct 54 ms 98220 KB Output is correct
85 Correct 53 ms 98252 KB Output is correct
86 Correct 51 ms 98252 KB Output is correct
87 Correct 51 ms 98300 KB Output is correct
88 Correct 51 ms 98252 KB Output is correct
89 Correct 48 ms 94284 KB Output is correct
90 Correct 51 ms 98340 KB Output is correct
91 Correct 54 ms 98104 KB Output is correct
92 Correct 49 ms 98252 KB Output is correct
93 Correct 50 ms 98160 KB Output is correct
94 Correct 49 ms 94216 KB Output is correct
95 Correct 51 ms 98136 KB Output is correct
96 Correct 50 ms 98252 KB Output is correct
97 Correct 53 ms 98288 KB Output is correct
98 Correct 51 ms 98288 KB Output is correct
99 Correct 90 ms 107396 KB Output is correct
100 Correct 64 ms 104120 KB Output is correct
101 Correct 62 ms 97380 KB Output is correct
102 Correct 78 ms 106060 KB Output is correct
103 Correct 139 ms 110500 KB Output is correct
104 Correct 78 ms 99372 KB Output is correct
105 Correct 127 ms 110724 KB Output is correct
106 Correct 63 ms 102572 KB Output is correct
107 Correct 60 ms 102028 KB Output is correct
108 Correct 140 ms 110836 KB Output is correct
109 Correct 121 ms 109256 KB Output is correct
110 Correct 128 ms 111120 KB Output is correct
111 Correct 51 ms 95544 KB Output is correct
112 Correct 51 ms 95588 KB Output is correct
113 Correct 113 ms 109108 KB Output is correct
114 Correct 59 ms 97732 KB Output is correct
115 Correct 157 ms 110296 KB Output is correct
116 Correct 130 ms 107084 KB Output is correct
117 Correct 51 ms 94860 KB Output is correct
118 Correct 91 ms 107920 KB Output is correct
119 Correct 65 ms 103824 KB Output is correct
120 Correct 123 ms 111984 KB Output is correct
121 Correct 104 ms 107620 KB Output is correct
122 Correct 52 ms 98120 KB Output is correct
123 Correct 53 ms 95148 KB Output is correct
124 Correct 59 ms 96804 KB Output is correct
125 Correct 131 ms 104968 KB Output is correct
126 Correct 62 ms 103116 KB Output is correct
127 Correct 64 ms 102640 KB Output is correct
128 Correct 121 ms 109504 KB Output is correct
129 Correct 101 ms 107436 KB Output is correct
130 Correct 103 ms 108036 KB Output is correct
131 Correct 67 ms 103900 KB Output is correct
132 Correct 63 ms 104008 KB Output is correct
133 Correct 183 ms 112944 KB Output is correct
134 Correct 80 ms 103368 KB Output is correct
135 Correct 60 ms 99532 KB Output is correct
136 Correct 63 ms 97372 KB Output is correct
137 Correct 69 ms 98512 KB Output is correct
138 Correct 54 ms 99508 KB Output is correct