oj.uz

Submission #886335

# Submission time Handle Problem Language Result Execution time Memory
886335 2023-12-11T22:16:58 Z Kutan Joker (BOI20_joker) C++14
100 / 100
 196 ms 28320 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;

const int N = 2e5 + 5;
const int B = 4500;

int n, m, q;
int ans[N];
pii edge[N];

int par[N], sz[N], f[N];
bool oke = 0;

struct Data{
    int u, su;
    int v, sv;
    Data(int _u = 0, int _su = 0, int _v = 0, int _sv = 0) {
        u = _u, su = _su, v = _v, sv = _sv;
    }
};

pii root(int x) {
    int u = x, w = 0;
    while(u != par[u]) {
        w ^= f[u];
        u = par[u];
    }
    return {u, w};
}

void unite(int ru, int rv, int w) {
    if (sz[ru] < sz[rv]) swap(ru, rv);    
    par[rv] = ru;   
    sz[ru] += sz[rv];    
    f[rv] = w;
}

struct Query{
    int l, r; 
    Query(int _l = 0, int _r = 0) {
        l = _l, r = _r;
    }
} Query[N];

void readip(){
    cin >> n >> m >> q;
    REP(i, 1, m) cin >> edge[i].first >> edge[i].second;
    REP(i, 1, q) cin >> Query[i].l >> Query[i].r;
}

void init() {
    REP(i, 1, n) {
        par[i] = i;
        sz[i] = 1;
        f[i] = 0;
    }
    oke = 0;
}

void dnc(int l, int r, int MinAns, int MaxAns) {
    int mid = (l + r) >> 1;
    ans[mid] = MaxAns;

    vector<Data> st1, st2;
    bool rem_oke1 = oke;

    REPD(i, r, mid) {
        int u = edge[i].fi, v = edge[i].se;
        const auto &[ru, wu] = root(u);
        const auto &[rv, wv] = root(v);
        if (ru == rv) {
            oke |= (wu == wv);
        }
        else {
            st1.eb(ru, sz[ru], rv, sz[rv]);
            unite(ru, rv, wu ^ wv ^ 1);
        }
    }

    bool rem_oke2 = oke;
    if (oke) ans[mid] = MinAns;
    else {
        for (int i = MinAns + 1; i < mid && i <= MaxAns; ++i) {
            int u = edge[i].fi, v = edge[i].se;
            const auto &[ru, wu] = root(u);
            const auto &[rv, wv] = root(v);
            if (ru == rv) {
                oke |= (wu == wv);
                if (oke) {
                    ans[mid] = i;
                    break;
                }
            }
            else {
                st2.eb(ru, sz[ru], rv, sz[rv]);
                unite(ru, rv, wu ^ wv ^ 1);
            }
        }
    }
    
    oke = rem_oke2;
    while(!st2.empty()) {
        const auto &[u, su, v, sv] = st2.back(); st2.pop_back();
        par[u] = u, sz[u] = su, f[u] = 0;
        par[v] = v, sz[v] = sv, f[v] = 0;
    }   


    if (l < mid) dnc(l, mid - 1, MinAns, ans[mid]);

    oke = rem_oke1;
    while(!st1.empty()) {
        const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
        par[u] = u, sz[u] = su, f[u] = 0;
        par[v] = v, sz[v] = sv, f[v] = 0;   
    }
    
    rem_oke1 = oke;
    REP(i, MinAns + 1, ans[mid]) {
        int u = edge[i].fi, v = edge[i].se;
        const auto &[ru, wu] = root(u);
        const auto &[rv, wv] = root(v);
        if (ru == rv) {
            oke |= (wu == wv);
        }
        else {
            st1.eb(ru, sz[ru], rv, sz[rv]);
            unite(ru, rv, wu ^ wv ^ 1);
        }
    }

    if (mid < r) dnc(mid + 1, r, ans[mid], MaxAns);

    oke = rem_oke1;
    while(!st1.empty()) {
        const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
        par[u] = u, sz[u] = su, f[u] = 0;
        par[v] = v, sz[v] = sv, f[v] = 0;   
    }
}

void solve() {
    init();
    dnc(1, m, 0, m);
    init();
    ans[m + 1] = m + 1;
    REP(i, 1, m) {
        int u = edge[i].fi, v = edge[i].se;
        const auto &[ru, wu] = root(u);
        const auto &[rv, wv] = root(v);
        if (ru == rv) {
            oke |= (wu == wv);
            if (oke) {
                ans[m + 1] = i;
                break;
            }
        }
        else unite(ru, rv, wu ^ wv ^ 1);
    }
    
    REP(i, 1, q) {
        if (ans[Query[i].r + 1] < Query[i].l)
            cout << "YES" << ln;
        else
            cout << "NO" << ln;
    }
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

Joker.cpp: In function 'void readip()':
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:181:5: note: in expansion of macro 'REP'
  181 |     REP(i, 1, m) cin >> edge[i].first >> edge[i].second;
      |     ^~~
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:182:5: note: in expansion of macro 'REP'
  182 |     REP(i, 1, q) cin >> Query[i].l >> Query[i].r;
      |     ^~~
Joker.cpp: In function 'void init()':
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:186:5: note: in expansion of macro 'REP'
  186 |     REP(i, 1, n) {
      |     ^~~
Joker.cpp: In function 'void dnc(int, int, int, int)':
Joker.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
Joker.cpp:201:5: note: in expansion of macro 'REPD'
  201 |     REPD(i, r, mid) {
      |     ^~~~
Joker.cpp:203:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  203 |         const auto &[ru, wu] = root(u);
      |                     ^
Joker.cpp:204:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  204 |         const auto &[rv, wv] = root(v);
      |                     ^
Joker.cpp:219:25: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  219 |             const auto &[ru, wu] = root(u);
      |                         ^
Joker.cpp:220:25: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  220 |             const auto &[rv, wv] = root(v);
      |                         ^
Joker.cpp:237:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  237 |         const auto &[u, su, v, sv] = st2.back(); st2.pop_back();
      |                     ^
Joker.cpp:247:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  247 |         const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
      |                     ^
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:253:5: note: in expansion of macro 'REP'
  253 |     REP(i, MinAns + 1, ans[mid]) {
      |     ^~~
Joker.cpp:255:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  255 |         const auto &[ru, wu] = root(u);
      |                     ^
Joker.cpp:256:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  256 |         const auto &[rv, wv] = root(v);
      |                     ^
Joker.cpp:270:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  270 |         const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
      |                     ^
Joker.cpp: In function 'void solve()':
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:281:5: note: in expansion of macro 'REP'
  281 |     REP(i, 1, m) {
      |     ^~~
Joker.cpp:283:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  283 |         const auto &[ru, wu] = root(u);
      |                     ^
Joker.cpp:284:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  284 |         const auto &[rv, wv] = root(v);
      |                     ^
Joker.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
Joker.cpp:295:5: note: in expansion of macro 'REP'
  295 |     REP(i, 1, q) {
      |     ^~~
Joker.cpp: In function 'void file()':
Joker.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4708 KB Output is correct
14 Correct 1 ms 4736 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4744 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4708 KB Output is correct
14 Correct 1 ms 4736 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4744 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 2 ms 4748 KB Output is correct
31 Correct 2 ms 4696 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4692 KB Output is correct
39 Correct 2 ms 4952 KB Output is correct
40 Correct 2 ms 4952 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 2 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 2 ms 4752 KB Output is correct
46 Correct 2 ms 4752 KB Output is correct
47 Correct 2 ms 4696 KB Output is correct
48 Correct 2 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 2 ms 4896 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4756 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 110 ms 15596 KB Output is correct
4 Correct 129 ms 20936 KB Output is correct
5 Correct 163 ms 22468 KB Output is correct
6 Correct 110 ms 20344 KB Output is correct
7 Correct 139 ms 19396 KB Output is correct
8 Correct 119 ms 14376 KB Output is correct
9 Correct 132 ms 15108 KB Output is correct
10 Correct 175 ms 19472 KB Output is correct
11 Correct 134 ms 16920 KB Output is correct
12 Correct 150 ms 21008 KB Output is correct
13 Correct 116 ms 12256 KB Output is correct
14 Correct 124 ms 15136 KB Output is correct
15 Correct 166 ms 18536 KB Output is correct
16 Correct 184 ms 20000 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4708 KB Output is correct
14 Correct 1 ms 4736 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4744 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 110 ms 15596 KB Output is correct
30 Correct 129 ms 20936 KB Output is correct
31 Correct 163 ms 22468 KB Output is correct
32 Correct 110 ms 20344 KB Output is correct
33 Correct 139 ms 19396 KB Output is correct
34 Correct 119 ms 14376 KB Output is correct
35 Correct 132 ms 15108 KB Output is correct
36 Correct 175 ms 19472 KB Output is correct
37 Correct 134 ms 16920 KB Output is correct
38 Correct 150 ms 21008 KB Output is correct
39 Correct 116 ms 12256 KB Output is correct
40 Correct 124 ms 15136 KB Output is correct
41 Correct 166 ms 18536 KB Output is correct
42 Correct 184 ms 20000 KB Output is correct
43 Correct 111 ms 15868 KB Output is correct
44 Correct 133 ms 21288 KB Output is correct
45 Correct 125 ms 18972 KB Output is correct
46 Correct 116 ms 22212 KB Output is correct
47 Correct 158 ms 19548 KB Output is correct
48 Correct 142 ms 16328 KB Output is correct
49 Correct 196 ms 19404 KB Output is correct
50 Correct 125 ms 15812 KB Output is correct
51 Correct 136 ms 17348 KB Output is correct
52 Correct 152 ms 17380 KB Output is correct
53 Correct 104 ms 12836 KB Output is correct
54 Correct 153 ms 15812 KB Output is correct
55 Correct 166 ms 18116 KB Output is correct
56 Correct 181 ms 19528 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4708 KB Output is correct
14 Correct 1 ms 4736 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4744 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 2 ms 4748 KB Output is correct
31 Correct 2 ms 4696 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4692 KB Output is correct
39 Correct 2 ms 4952 KB Output is correct
40 Correct 2 ms 4952 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 2 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 2 ms 4752 KB Output is correct
46 Correct 2 ms 4752 KB Output is correct
47 Correct 2 ms 4696 KB Output is correct
48 Correct 2 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 2 ms 4896 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4756 KB Output is correct
55 Correct 83 ms 13768 KB Output is correct
56 Correct 97 ms 19668 KB Output is correct
57 Correct 106 ms 16380 KB Output is correct
58 Correct 92 ms 21696 KB Output is correct
59 Correct 117 ms 15048 KB Output is correct
60 Correct 135 ms 15036 KB Output is correct
61 Correct 123 ms 14588 KB Output is correct
62 Correct 126 ms 19136 KB Output is correct
63 Correct 88 ms 12360 KB Output is correct
64 Correct 121 ms 15304 KB Output is correct
65 Correct 157 ms 15364 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4708 KB Output is correct
14 Correct 1 ms 4736 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4744 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4744 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 2 ms 4748 KB Output is correct
31 Correct 2 ms 4696 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4692 KB Output is correct
39 Correct 2 ms 4952 KB Output is correct
40 Correct 2 ms 4952 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 2 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 2 ms 4752 KB Output is correct
46 Correct 2 ms 4752 KB Output is correct
47 Correct 2 ms 4696 KB Output is correct
48 Correct 2 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 2 ms 4896 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4756 KB Output is correct
55 Correct 110 ms 15596 KB Output is correct
56 Correct 129 ms 20936 KB Output is correct
57 Correct 163 ms 22468 KB Output is correct
58 Correct 110 ms 20344 KB Output is correct
59 Correct 139 ms 19396 KB Output is correct
60 Correct 119 ms 14376 KB Output is correct
61 Correct 132 ms 15108 KB Output is correct
62 Correct 175 ms 19472 KB Output is correct
63 Correct 134 ms 16920 KB Output is correct
64 Correct 150 ms 21008 KB Output is correct
65 Correct 116 ms 12256 KB Output is correct
66 Correct 124 ms 15136 KB Output is correct
67 Correct 166 ms 18536 KB Output is correct
68 Correct 184 ms 20000 KB Output is correct
69 Correct 111 ms 15868 KB Output is correct
70 Correct 133 ms 21288 KB Output is correct
71 Correct 125 ms 18972 KB Output is correct
72 Correct 116 ms 22212 KB Output is correct
73 Correct 158 ms 19548 KB Output is correct
74 Correct 142 ms 16328 KB Output is correct
75 Correct 196 ms 19404 KB Output is correct
76 Correct 125 ms 15812 KB Output is correct
77 Correct 136 ms 17348 KB Output is correct
78 Correct 152 ms 17380 KB Output is correct
79 Correct 104 ms 12836 KB Output is correct
80 Correct 153 ms 15812 KB Output is correct
81 Correct 166 ms 18116 KB Output is correct
82 Correct 181 ms 19528 KB Output is correct
83 Correct 83 ms 13768 KB Output is correct
84 Correct 97 ms 19668 KB Output is correct
85 Correct 106 ms 16380 KB Output is correct
86 Correct 92 ms 21696 KB Output is correct
87 Correct 117 ms 15048 KB Output is correct
88 Correct 135 ms 15036 KB Output is correct
89 Correct 123 ms 14588 KB Output is correct
90 Correct 126 ms 19136 KB Output is correct
91 Correct 88 ms 12360 KB Output is correct
92 Correct 121 ms 15304 KB Output is correct
93 Correct 157 ms 15364 KB Output is correct
94 Correct 113 ms 16584 KB Output is correct
95 Correct 176 ms 28320 KB Output is correct
96 Correct 125 ms 19004 KB Output is correct
97 Correct 115 ms 22468 KB Output is correct
98 Correct 135 ms 20916 KB Output is correct
99 Correct 152 ms 15388 KB Output is correct
100 Correct 166 ms 26196 KB Output is correct
101 Correct 132 ms 16628 KB Output is correct
102 Correct 150 ms 17436 KB Output is correct
103 Correct 165 ms 18508 KB Output is correct
104 Correct 119 ms 15088 KB Output is correct
105 Correct 161 ms 18048 KB Output is correct
106 Correct 178 ms 17620 KB Output is correct
107 Correct 82 ms 15244 KB Output is correct
108 Correct 111 ms 16472 KB Output is correct
109 Correct 134 ms 16696 KB Output is correct
110 Correct 109 ms 16324 KB Output is correct
111 Correct 114 ms 16328 KB Output is correct
112 Correct 110 ms 16324 KB Output is correct
113 Correct 115 ms 16392 KB Output is correct
114 Correct 112 ms 16384 KB Output is correct
115 Correct 112 ms 16324 KB Output is correct
116 Correct 115 ms 16388 KB Output is correct