oj.uz

Submission #240578

# Submission time Handle Problem Language Result Execution time Memory
240578 2020-06-20T07:04:15 Z b00n0rp Bridges (APIO19_bridges) C++17
100 / 100
 2771 ms 260784 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("Ofast,unroll-loops")
/* I don't understand these pragmas at all. 
   Earlier I added all the optimizations I could find but 
   upon my short amount of testing, these 2 are enough and adding more makes it slower. */
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // (UNCOMMENT FOR CIN/COUT) \
    FAST_IO
    PRECISION(10)
 
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    sfl(t);
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m,q;
vpii adj[50005];
pair<pii,int> bridges[100005];
int BLK = 1000;

int par[50005];
int sz[50005];

int find(int x){
    if(par[x] == x) return x;
    return find(par[x]);
    // no path compression cuz rollbacks
}

int find2(int x){
    if(par[x] == x) return x;
    return par[x] = find(par[x]);
}

stack<int> st;

void merge(int u,int v){
    u = find(u);
    v = find(v);
    if(u == v) return;
    if(sz[u] > sz[v]) swap(u,v);
    par[u] = v;
    sz[v]+=sz[u];
    st.push(u); 
}

void merge2(int u,int v){
    u = find2(u);
    v = find2(v);
    if(u == v) return;
    if(sz[u] > sz[v]) swap(u,v);
    par[u] = v;
    sz[v]+=sz[u]; 
}

void rollback(){
    int u = st.top();
    sz[par[u]]-=sz[u];
    par[u] = u;
    st.pop();
}
 
vector<pair<pii,int> > upd,quer;
vi ggedg;
bitset<100005> chan;
vi todo[100005];

void respawn(){
    upd.clear();
    quer.clear();
    chan.reset();
    REP(i,n+3){
        sz[i] = 1;
        par[i] = i;
    }
    ggedg.clear();
    while(st.size()) st.pop();
}

bool cmp(int x,int y){
    return bridges[x].S > bridges[y].S;
}

void solvethetestcase(){
    sfl2(n,m)
    FOR(i,1,m+1){
        int u,v,w;
        sfl3(u,v,w)
        adj[u].pb({v,i});
        adj[v].pb({u,i});
        bridges[i] = {{u,v},w};
        // trace(i,bridges[i].S);
    }
    sfl(q)
    int l = 0;
    respawn();
    vpii result;
    REP(i,q){
        if(1){
            int t;
            sfl(t)
            if(t == 1){
                int e,val;
                sfl2(e,val)
                chan[e] = 1;
                upd.pb({{e,val},i});
            }
            else{
                int u,w;
                sfl2(u,w)
                quer.pb({{-w,u},i});
            }
        }  
        if(i == q-1 or (i+1)%BLK == 0){
            // trace(i);
            FOR(j,1,m+1){
                if(!chan[j]) ggedg.pb(j); 
            }
            int c1 = 0,c2 = 0;
            while(c1 < upd.size() or c2 < quer.size()){
                if(c1 != upd.size() and (c2 == quer.size() or upd[c1].S < quer[c2].S)){
                    bridges[upd[c1].F.F].S = upd[c1].F.S;
                    c1++;
                }
                else{
                    for(auto x:upd){
                        if(bridges[x.F.F].S >= -quer[c2].F.F) todo[quer[c2].S].pb(x.F.F);
                    }
                    c2++;
                }
            }
            sort(all(quer));
            sort(all(ggedg),cmp);
            int zz = 0;
            for(auto x:quer){
                // trace(x.F.F,x.F.S,x.S);
                while(zz < ggedg.size() and bridges[ggedg[zz]].S >= -x.F.F){    
                    // trace(zz,ggedg[zz]);
                    merge2(bridges[ggedg[zz]].F.F,bridges[ggedg[zz]].F.S);
                    zz++;
                }
                int ss = st.size();
                for(auto y:todo[x.S]){
                    // trace(y);
                    merge(bridges[y].F.F,bridges[y].F.S);
                }
                result.pb({x.S,sz[find(x.F.S)]});
                while(st.size() != ss) rollback();

            }
            respawn();
        }
    }
    sort(all(result));
    for(auto x:result){
        pfl(x.S)
    }
    // cout << runtime() << endl;
}

Compilation message

bridges.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
bridges.cpp:210:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR CIN/COUT) \
     ^
bridges.cpp:215:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
bridges.cpp:218:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^
bridges.cpp: In function 'void solvethetestcase()':
bridges.cpp:328:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(c1 < upd.size() or c2 < quer.size()){
                   ~~~^~~~~~~~~~~~
bridges.cpp:328:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(c1 < upd.size() or c2 < quer.size()){
                                      ~~~^~~~~~~~~~~~~
bridges.cpp:329:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(c1 != upd.size() and (c2 == quer.size() or upd[c1].S < quer[c2].S)){
                    ~~~^~~~~~~~~~~~~
bridges.cpp:329:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(c1 != upd.size() and (c2 == quer.size() or upd[c1].S < quer[c2].S)){
                                          ~~~^~~~~~~~~~~~~~
bridges.cpp:345:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(zz < ggedg.size() and bridges[ggedg[zz]].S >= -x.F.F){    
                       ~~~^~~~~~~~~~~~~~
bridges.cpp:356:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(st.size() != ss) rollback();
                       ~~~~~~~~~~^~~~~
bridges.cpp:303:9: warning: unused variable 'l' [-Wunused-variable]
     int l = 0;
         ^
bridges.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
bridges.cpp:293:5: note: in expansion of macro 'sfl2'
     sfl2(n,m)
     ^~~~
bridges.cpp:95:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:296:9: note: in expansion of macro 'sfl3'
         sfl3(u,v,w)
         ^~~~
bridges.cpp:93:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
bridges.cpp:302:5: note: in expansion of macro 'sfl'
     sfl(q)
     ^~~
bridges.cpp:93:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
bridges.cpp:309:13: note: in expansion of macro 'sfl'
             sfl(t)
             ^~~
bridges.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
bridges.cpp:312:17: note: in expansion of macro 'sfl2'
                 sfl2(e,val)
                 ^~~~
bridges.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
bridges.cpp:318:17: note: in expansion of macro 'sfl2'
                 sfl2(u,w)
                 ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3840 KB Output is correct
2 Correct 7 ms 3840 KB Output is correct
3 Correct 54 ms 17528 KB Output is correct
4 Correct 13 ms 4480 KB Output is correct
5 Correct 62 ms 19064 KB Output is correct
6 Correct 50 ms 19324 KB Output is correct
7 Correct 56 ms 19324 KB Output is correct
8 Correct 62 ms 16248 KB Output is correct
9 Correct 73 ms 27896 KB Output is correct
10 Correct 65 ms 17912 KB Output is correct
11 Correct 69 ms 17628 KB Output is correct
12 Correct 80 ms 22392 KB Output is correct
13 Correct 73 ms 18684 KB Output is correct
14 Correct 68 ms 17188 KB Output is correct
15 Correct 73 ms 18856 KB Output is correct
16 Correct 67 ms 24300 KB Output is correct
17 Correct 67 ms 22520 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1785 ms 145956 KB Output is correct
2 Correct 1778 ms 146060 KB Output is correct
3 Correct 1864 ms 146568 KB Output is correct
4 Correct 1857 ms 145752 KB Output is correct
5 Correct 1883 ms 146932 KB Output is correct
6 Correct 2579 ms 260784 KB Output is correct
7 Correct 2576 ms 253952 KB Output is correct
8 Correct 2535 ms 253676 KB Output is correct
9 Correct 67 ms 7276 KB Output is correct
10 Correct 1465 ms 196368 KB Output is correct
11 Correct 1383 ms 195184 KB Output is correct
12 Correct 1480 ms 104508 KB Output is correct
13 Correct 1465 ms 91248 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1513 ms 146164 KB Output is correct
2 Correct 1184 ms 194408 KB Output is correct
3 Correct 1722 ms 201928 KB Output is correct
4 Correct 1477 ms 145040 KB Output is correct
5 Correct 66 ms 7276 KB Output is correct
6 Correct 1667 ms 182892 KB Output is correct
7 Correct 1349 ms 132348 KB Output is correct
8 Correct 1139 ms 98268 KB Output is correct
9 Correct 952 ms 79736 KB Output is correct
10 Correct 864 ms 57256 KB Output is correct
11 Correct 974 ms 74616 KB Output is correct
12 Correct 846 ms 54660 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1879 ms 17524 KB Output is correct
2 Correct 75 ms 7276 KB Output is correct
3 Correct 200 ms 13168 KB Output is correct
4 Correct 88 ms 13292 KB Output is correct
5 Correct 889 ms 17552 KB Output is correct
6 Correct 1754 ms 17560 KB Output is correct
7 Correct 810 ms 17676 KB Output is correct
8 Correct 897 ms 13388 KB Output is correct
9 Correct 877 ms 13432 KB Output is correct
10 Correct 878 ms 13432 KB Output is correct
11 Correct 1382 ms 16120 KB Output is correct
12 Correct 1363 ms 16016 KB Output is correct
13 Correct 1416 ms 15984 KB Output is correct
14 Correct 754 ms 17692 KB Output is correct
15 Correct 806 ms 17524 KB Output is correct
16 Correct 1844 ms 16580 KB Output is correct
17 Correct 1825 ms 16524 KB Output is correct
18 Correct 1809 ms 16760 KB Output is correct
19 Correct 1833 ms 16724 KB Output is correct
20 Correct 1575 ms 16240 KB Output is correct
21 Correct 1609 ms 16212 KB Output is correct
22 Correct 1838 ms 16476 KB Output is correct
23 Correct 966 ms 15280 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1785 ms 145956 KB Output is correct
2 Correct 1778 ms 146060 KB Output is correct
3 Correct 1864 ms 146568 KB Output is correct
4 Correct 1857 ms 145752 KB Output is correct
5 Correct 1883 ms 146932 KB Output is correct
6 Correct 2579 ms 260784 KB Output is correct
7 Correct 2576 ms 253952 KB Output is correct
8 Correct 2535 ms 253676 KB Output is correct
9 Correct 67 ms 7276 KB Output is correct
10 Correct 1465 ms 196368 KB Output is correct
11 Correct 1383 ms 195184 KB Output is correct
12 Correct 1480 ms 104508 KB Output is correct
13 Correct 1465 ms 91248 KB Output is correct
14 Correct 1513 ms 146164 KB Output is correct
15 Correct 1184 ms 194408 KB Output is correct
16 Correct 1722 ms 201928 KB Output is correct
17 Correct 1477 ms 145040 KB Output is correct
18 Correct 66 ms 7276 KB Output is correct
19 Correct 1667 ms 182892 KB Output is correct
20 Correct 1349 ms 132348 KB Output is correct
21 Correct 1139 ms 98268 KB Output is correct
22 Correct 952 ms 79736 KB Output is correct
23 Correct 864 ms 57256 KB Output is correct
24 Correct 974 ms 74616 KB Output is correct
25 Correct 846 ms 54660 KB Output is correct
26 Correct 1984 ms 146744 KB Output is correct
27 Correct 2287 ms 205556 KB Output is correct
28 Correct 1924 ms 143276 KB Output is correct
29 Correct 1244 ms 56840 KB Output is correct
30 Correct 2137 ms 178924 KB Output is correct
31 Correct 2157 ms 183532 KB Output is correct
32 Correct 2422 ms 184660 KB Output is correct
33 Correct 2016 ms 144128 KB Output is correct
34 Correct 2197 ms 144628 KB Output is correct
35 Correct 1959 ms 145272 KB Output is correct
36 Correct 1402 ms 70388 KB Output is correct
37 Correct 1468 ms 67704 KB Output is correct
38 Correct 1294 ms 64636 KB Output is correct
39 Correct 1092 ms 36528 KB Output is correct
40 Correct 1141 ms 35044 KB Output is correct
41 Correct 1132 ms 34020 KB Output is correct
42 Correct 1036 ms 33392 KB Output is correct
43 Correct 1025 ms 32236 KB Output is correct
44 Correct 1091 ms 31168 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3840 KB Output is correct
2 Correct 7 ms 3840 KB Output is correct
3 Correct 54 ms 17528 KB Output is correct
4 Correct 13 ms 4480 KB Output is correct
5 Correct 62 ms 19064 KB Output is correct
6 Correct 50 ms 19324 KB Output is correct
7 Correct 56 ms 19324 KB Output is correct
8 Correct 62 ms 16248 KB Output is correct
9 Correct 73 ms 27896 KB Output is correct
10 Correct 65 ms 17912 KB Output is correct
11 Correct 69 ms 17628 KB Output is correct
12 Correct 80 ms 22392 KB Output is correct
13 Correct 73 ms 18684 KB Output is correct
14 Correct 68 ms 17188 KB Output is correct
15 Correct 73 ms 18856 KB Output is correct
16 Correct 67 ms 24300 KB Output is correct
17 Correct 67 ms 22520 KB Output is correct
18 Correct 1785 ms 145956 KB Output is correct
19 Correct 1778 ms 146060 KB Output is correct
20 Correct 1864 ms 146568 KB Output is correct
21 Correct 1857 ms 145752 KB Output is correct
22 Correct 1883 ms 146932 KB Output is correct
23 Correct 2579 ms 260784 KB Output is correct
24 Correct 2576 ms 253952 KB Output is correct
25 Correct 2535 ms 253676 KB Output is correct
26 Correct 67 ms 7276 KB Output is correct
27 Correct 1465 ms 196368 KB Output is correct
28 Correct 1383 ms 195184 KB Output is correct
29 Correct 1480 ms 104508 KB Output is correct
30 Correct 1465 ms 91248 KB Output is correct
31 Correct 1513 ms 146164 KB Output is correct
32 Correct 1184 ms 194408 KB Output is correct
33 Correct 1722 ms 201928 KB Output is correct
34 Correct 1477 ms 145040 KB Output is correct
35 Correct 66 ms 7276 KB Output is correct
36 Correct 1667 ms 182892 KB Output is correct
37 Correct 1349 ms 132348 KB Output is correct
38 Correct 1139 ms 98268 KB Output is correct
39 Correct 952 ms 79736 KB Output is correct
40 Correct 864 ms 57256 KB Output is correct
41 Correct 974 ms 74616 KB Output is correct
42 Correct 846 ms 54660 KB Output is correct
43 Correct 1879 ms 17524 KB Output is correct
44 Correct 75 ms 7276 KB Output is correct
45 Correct 200 ms 13168 KB Output is correct
46 Correct 88 ms 13292 KB Output is correct
47 Correct 889 ms 17552 KB Output is correct
48 Correct 1754 ms 17560 KB Output is correct
49 Correct 810 ms 17676 KB Output is correct
50 Correct 897 ms 13388 KB Output is correct
51 Correct 877 ms 13432 KB Output is correct
52 Correct 878 ms 13432 KB Output is correct
53 Correct 1382 ms 16120 KB Output is correct
54 Correct 1363 ms 16016 KB Output is correct
55 Correct 1416 ms 15984 KB Output is correct
56 Correct 754 ms 17692 KB Output is correct
57 Correct 806 ms 17524 KB Output is correct
58 Correct 1844 ms 16580 KB Output is correct
59 Correct 1825 ms 16524 KB Output is correct
60 Correct 1809 ms 16760 KB Output is correct
61 Correct 1833 ms 16724 KB Output is correct
62 Correct 1575 ms 16240 KB Output is correct
63 Correct 1609 ms 16212 KB Output is correct
64 Correct 1838 ms 16476 KB Output is correct
65 Correct 966 ms 15280 KB Output is correct
66 Correct 1984 ms 146744 KB Output is correct
67 Correct 2287 ms 205556 KB Output is correct
68 Correct 1924 ms 143276 KB Output is correct
69 Correct 1244 ms 56840 KB Output is correct
70 Correct 2137 ms 178924 KB Output is correct
71 Correct 2157 ms 183532 KB Output is correct
72 Correct 2422 ms 184660 KB Output is correct
73 Correct 2016 ms 144128 KB Output is correct
74 Correct 2197 ms 144628 KB Output is correct
75 Correct 1959 ms 145272 KB Output is correct
76 Correct 1402 ms 70388 KB Output is correct
77 Correct 1468 ms 67704 KB Output is correct
78 Correct 1294 ms 64636 KB Output is correct
79 Correct 1092 ms 36528 KB Output is correct
80 Correct 1141 ms 35044 KB Output is correct
81 Correct 1132 ms 34020 KB Output is correct
82 Correct 1036 ms 33392 KB Output is correct
83 Correct 1025 ms 32236 KB Output is correct
84 Correct 1091 ms 31168 KB Output is correct
85 Correct 2482 ms 151544 KB Output is correct
86 Correct 262 ms 26108 KB Output is correct
87 Correct 128 ms 34692 KB Output is correct
88 Correct 1435 ms 177956 KB Output is correct
89 Correct 2499 ms 148864 KB Output is correct
90 Correct 1471 ms 194132 KB Output is correct
91 Correct 2078 ms 147184 KB Output is correct
92 Correct 1980 ms 147048 KB Output is correct
93 Correct 2771 ms 220768 KB Output is correct
94 Correct 2393 ms 150336 KB Output is correct
95 Correct 2240 ms 149792 KB Output is correct
96 Correct 2362 ms 230092 KB Output is correct
97 Correct 1097 ms 83696 KB Output is correct
98 Correct 1197 ms 75868 KB Output is correct
99 Correct 2517 ms 153128 KB Output is correct
100 Correct 2637 ms 150624 KB Output is correct
101 Correct 2720 ms 150744 KB Output is correct
102 Correct 2551 ms 150636 KB Output is correct
103 Correct 2380 ms 240704 KB Output is correct
104 Correct 2436 ms 240088 KB Output is correct
105 Correct 1967 ms 95576 KB Output is correct
106 Correct 1629 ms 55500 KB Output is correct
107 Correct 1864 ms 108560 KB Output is correct
108 Correct 2512 ms 220168 KB Output is correct
109 Correct 1653 ms 228760 KB Output is correct