oj.uz

Submission #288783

# Submission time Handle Problem Language Result Execution time Memory
288783 2020-09-01T22:06:36 Z Aaeria Rectangles (IOI19_rect) C++14
100 / 100
 3573 ms 533552 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,avx2,fma,mmx,popcnt,tune=native" //#pragma GCC optimize "prefetch-loop-arrays"
using namespace std; using namespace __gnu_pbds;
#define foru(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a);i>=(b);i--)
#define fori(a,b) foru(i,a,b)
#define forj(a,b) foru(j,a,b)
#define fork(a,b) foru(k,a,b)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define P2(x) (1LL<<(x))
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#if __SIZEOF_INT128__
    typedef __int128_t i128; typedef __uint128_t ui128;
#else
    typedef int64_t i128; typedef uint64_t ui128;
#endif
typedef int64_t ll;  typedef uint64_t ull; typedef int8_t byte; typedef long double lld;
typedef pair<short,short> pii; typedef pair<ll,ll> pll; typedef pair<lld,lld> pdd;
template<class T1,class T2> using ordered_map=tree<T1,T2,less<T1>,rb_tree_tag,tree_order_statistics_node_update>; template<class T1> using ordered_set=ordered_map<T1,null_type>;
template<class T> using minpq=std::priority_queue<T,vector<T>,greater<T>>; template<class T> using maxpq=std::priority_queue<T,vector<T>,less<T>>;
template<class T> using minpairingheap=__gnu_pbds::priority_queue<T,greater<T>,pairing_heap_tag>; template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,less<T>,pairing_heap_tag>;
const int inf=0x3f3f3f3f,MOD=1e9+7; const ll INF=0x3f3f3f3f3f3f3f3f; const lld PI=acos((lld)-1);
const ll SEED=443214^chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937 randgen(SEED); int randint(int a, int b){return uniform_int_distribution<int>(a,b)(randgen);} ll randll(ll a, ll b){return uniform_int_distribution<ll>(a,b)(randgen);}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll fpow(ll a,ll b){if(!b) return 1; ll t=fpow(a,b/2); if(b&1) return t*t%MOD*a%MOD; return t*t%MOD;}
template<class T1,class T2>constexpr const auto _min(const T1&x,const T2&y){return x<y?x:y;} template<class T,class...Ts>constexpr auto _min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T1,class T2>constexpr const auto _max(const T1&x,const T2&y){return x>y?x:y;} template<class T,class...Ts>constexpr auto _max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
struct chash{
    static ll splitmix64(ll x){x+=0x9e3779b97f4a7c15; x=(x^(x>>30))*0xbf58476d1ce4e5b9; x=(x^(x>>27))*0x94d049bb133111eb; return x^(x>>31);}
    template<class T> size_t operator()(const T &x) const{return splitmix64(hash<T>()(x)+SEED);}
    template<class T1,class T2> size_t operator()(const pair<T1,T2>&x)const{return 31*operator()(x.first)+operator()(x.second);}};
void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
string to_string(char c){return string(1,c);} string to_string(char* s){return (string)s;} string to_string(string s){return s;}
template<class T> string to_string(complex<T> c){stringstream ss; ss<<c; return ss.str();} template<class T1,class T2> string to_string(pair<T1,T2> p){return "("+to_string(p.pf)+","+to_string(p.ps)+")";}
template<size_t SZ> string to_string(bitset<SZ> b){string ret=""; fori(0,SZ) ret+=char('0'+b[i]); return ret;}
template<class T> string to_string(T v){string ret; for(const auto& x:v) ret+=","+to_string(x); ret[0]='{'; return ret+"}";}
void DBG(){cerr<<"]"<<endl;} template<class T,class... Ts> void DBG(T x,Ts... xs){cerr<<to_string(x); if(sizeof...(xs)) cerr<<", "; DBG(xs...);}
#ifdef LOCAL_PROJECT
    #define dbg(...) cerr<<"Line("<< __LINE__<<") -> ["<<#__VA_ARGS__<<"]: [", DBG(__VA_ARGS__)
#else
    #define dbg(...) 0
#endif
#define nl "\n"

const int N=2510,M=MOD;
int n,m,h[N][N],ans,a,b,c,cnt,ml[N],mr[N];
stack<short> mx;
short xs[2][N][N],ys[2][N][N];
vector<pii> rev[N];
vector<array<int,3>> xy[N][N];
struct BITree{
    int bit[N];
    void upd(int x,int v){
        for(;x<N;x+=x&-x) bit[x]+=v;
    }
    int query(int x){
        ll ret=0;
        for(;x;x-=x&-x) ret+=bit[x];
        return ret;
    }
    int query(int l,int r){
        return query(r)-query(l-1);
    }
} bit;
long long int count_rectangles(vector<vector<int>> _a){
    n=sz(_a); m=sz(_a[0]); seto(h,inf);
    fori(1,n+1) forj(1,m+1) h[i][j]=_a[i-1][j-1];
    ford(i,n,1){
        mx.push(0);
        forj(1,m+1){
            for(;h[i][mx.top()]<=h[i][j];mx.pop());
            ml[j]=mx.top()+1;
            mx.push(j);
        }
        while(sz(mx)) mx.pop();
        mx.push(m+1);
        ford(j,m,1){
            for(;h[i][mx.top()]<=h[i][j];mx.pop());
            mr[j]=mx.top()-1;
            mx.push(j);
        }
        while(sz(mx)) mx.pop();
        for(auto j:rev[i&1]) xs[i&1][j.pf][j.ps]=0;
        rev[i&1].clear();
        forj(1,m+1){
            if(1<ml[j]&&mr[j]<m&&!xs[i&1][ml[j]][mr[j]-ml[j]+1]){
                a=xs[i&1][ml[j]][mr[j]-ml[j]+1]=xs[i&1^1][ml[j]][mr[j]-ml[j]+1]+1;
                xy[i][ml[j]].pb({a,1,mr[j]-ml[j]+1}); rev[i&1].eb(ml[j],mr[j]-ml[j]+1);
            }
        }
        //dbg(i);
    }
    ford(i,m,1){
        mx.push(0);
        forj(1,n+1){
            for(;h[mx.top()][i]<=h[j][i];mx.pop());
            ml[j]=mx.top()+1;
            mx.push(j);
        }
        while(sz(mx)) mx.pop();
        mx.push(n+1);
        ford(j,n,1){
            for(;h[mx.top()][i]<=h[j][i];mx.pop());
            mr[j]=mx.top()-1;
            mx.push(j);
        }
        while(sz(mx)) mx.pop();
        for(auto j:rev[i&1]) ys[i&1][j.pf][j.ps]=0;
        rev[i&1].clear();
        forj(1,n+1) if(1<ml[j]&&mr[j]<n&&!ys[i&1][ml[j]][mr[j]-ml[j]+1]){
            a=ys[i&1][ml[j]][mr[j]-ml[j]+1]=ys[i&1^1][ml[j]][mr[j]-ml[j]+1]+1;
            xy[ml[j]][i].pb({mr[j]-ml[j]+1,0,a}); rev[i&1].eb(ml[j],mr[j]-ml[j]+1);
        }
    }
    fori(1,n+1) forj(1,m+1){
        sort(all(xy[i][j])); dbg(xy[i][j]);
        for(auto k:xy[i][j]){
            if(k[1]) ans+=bit.query(k[2],N-1);
            else bit.upd(k[2],1);
        }
        for(auto k:xy[i][j]) if(!k[1]) bit.upd(k[2],-1);//*/
    }
    return ans;
}


/**
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6

5 5
9 9 9 9 1
9 8 7 6 1
9 7 6 5 1
9 6 5 4 1
1 1 1 1 1
*/

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:105:53: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  105 |                 a=xs[i&1][ml[j]][mr[j]-ml[j]+1]=xs[i&1^1][ml[j]][mr[j]-ml[j]+1]+1;
      |                                                    ~^~
rect.cpp:129:49: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  129 |             a=ys[i&1][ml[j]][mr[j]-ml[j]+1]=ys[i&1^1][ml[j]][mr[j]-ml[j]+1]+1;
      |                                                ~^~
rect.cpp:59:22: warning: statement has no effect [-Wunused-value]
   59 |     #define dbg(...) 0
      |                      ^
rect.cpp:134:30: note: in expansion of macro 'dbg'
  134 |         sort(all(xy[i][j])); dbg(xy[i][j]);
      |                              ^~~
rect.cpp: In function 'void fileIn(std::string)':
rect.cpp:50:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 | void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
      |                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp: In function 'void fileOut(std::string)':
rect.cpp:50:84: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 | void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
      |                                                                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 173048 KB Output is correct
2 Correct 115 ms 173436 KB Output is correct
3 Correct 114 ms 173432 KB Output is correct
4 Correct 117 ms 173432 KB Output is correct
5 Correct 114 ms 173048 KB Output is correct
6 Correct 115 ms 173560 KB Output is correct
7 Correct 115 ms 173304 KB Output is correct
8 Correct 114 ms 173432 KB Output is correct
9 Correct 115 ms 173560 KB Output is correct
10 Correct 114 ms 173432 KB Output is correct
11 Correct 118 ms 173636 KB Output is correct
12 Correct 117 ms 173432 KB Output is correct
13 Correct 114 ms 173052 KB Output is correct
14 Correct 113 ms 173048 KB Output is correct
15 Correct 118 ms 173092 KB Output is correct
16 Correct 114 ms 173048 KB Output is correct
17 Correct 115 ms 173052 KB Output is correct
18 Correct 113 ms 173048 KB Output is correct
19 Correct 114 ms 173432 KB Output is correct
20 Correct 115 ms 173048 KB Output is correct
21 Correct 116 ms 173048 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 173048 KB Output is correct
2 Correct 115 ms 173436 KB Output is correct
3 Correct 114 ms 173432 KB Output is correct
4 Correct 117 ms 173432 KB Output is correct
5 Correct 114 ms 173048 KB Output is correct
6 Correct 115 ms 173560 KB Output is correct
7 Correct 115 ms 173304 KB Output is correct
8 Correct 114 ms 173432 KB Output is correct
9 Correct 115 ms 173560 KB Output is correct
10 Correct 114 ms 173432 KB Output is correct
11 Correct 118 ms 173636 KB Output is correct
12 Correct 117 ms 173432 KB Output is correct
13 Correct 114 ms 173052 KB Output is correct
14 Correct 113 ms 173048 KB Output is correct
15 Correct 118 ms 173092 KB Output is correct
16 Correct 114 ms 173048 KB Output is correct
17 Correct 116 ms 174580 KB Output is correct
18 Correct 117 ms 174712 KB Output is correct
19 Correct 119 ms 174584 KB Output is correct
20 Correct 117 ms 174456 KB Output is correct
21 Correct 119 ms 174584 KB Output is correct
22 Correct 120 ms 174584 KB Output is correct
23 Correct 118 ms 174588 KB Output is correct
24 Correct 122 ms 174072 KB Output is correct
25 Correct 115 ms 173052 KB Output is correct
26 Correct 113 ms 173048 KB Output is correct
27 Correct 114 ms 173432 KB Output is correct
28 Correct 115 ms 173048 KB Output is correct
29 Correct 116 ms 173048 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 173048 KB Output is correct
2 Correct 115 ms 173436 KB Output is correct
3 Correct 114 ms 173432 KB Output is correct
4 Correct 117 ms 173432 KB Output is correct
5 Correct 114 ms 173048 KB Output is correct
6 Correct 115 ms 173560 KB Output is correct
7 Correct 115 ms 173304 KB Output is correct
8 Correct 114 ms 173432 KB Output is correct
9 Correct 115 ms 173560 KB Output is correct
10 Correct 114 ms 173432 KB Output is correct
11 Correct 118 ms 173636 KB Output is correct
12 Correct 117 ms 173432 KB Output is correct
13 Correct 114 ms 173052 KB Output is correct
14 Correct 113 ms 173048 KB Output is correct
15 Correct 118 ms 173092 KB Output is correct
16 Correct 114 ms 173048 KB Output is correct
17 Correct 116 ms 174580 KB Output is correct
18 Correct 117 ms 174712 KB Output is correct
19 Correct 119 ms 174584 KB Output is correct
20 Correct 117 ms 174456 KB Output is correct
21 Correct 119 ms 174584 KB Output is correct
22 Correct 120 ms 174584 KB Output is correct
23 Correct 118 ms 174588 KB Output is correct
24 Correct 122 ms 174072 KB Output is correct
25 Correct 129 ms 178016 KB Output is correct
26 Correct 134 ms 178016 KB Output is correct
27 Correct 128 ms 178040 KB Output is correct
28 Correct 125 ms 177276 KB Output is correct
29 Correct 134 ms 178296 KB Output is correct
30 Correct 133 ms 178424 KB Output is correct
31 Correct 131 ms 178168 KB Output is correct
32 Correct 133 ms 178168 KB Output is correct
33 Correct 115 ms 173052 KB Output is correct
34 Correct 113 ms 173048 KB Output is correct
35 Correct 114 ms 173432 KB Output is correct
36 Correct 115 ms 173048 KB Output is correct
37 Correct 116 ms 173048 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 173048 KB Output is correct
2 Correct 115 ms 173436 KB Output is correct
3 Correct 114 ms 173432 KB Output is correct
4 Correct 117 ms 173432 KB Output is correct
5 Correct 114 ms 173048 KB Output is correct
6 Correct 115 ms 173560 KB Output is correct
7 Correct 115 ms 173304 KB Output is correct
8 Correct 114 ms 173432 KB Output is correct
9 Correct 115 ms 173560 KB Output is correct
10 Correct 114 ms 173432 KB Output is correct
11 Correct 118 ms 173636 KB Output is correct
12 Correct 117 ms 173432 KB Output is correct
13 Correct 114 ms 173052 KB Output is correct
14 Correct 113 ms 173048 KB Output is correct
15 Correct 118 ms 173092 KB Output is correct
16 Correct 114 ms 173048 KB Output is correct
17 Correct 116 ms 174580 KB Output is correct
18 Correct 117 ms 174712 KB Output is correct
19 Correct 119 ms 174584 KB Output is correct
20 Correct 117 ms 174456 KB Output is correct
21 Correct 119 ms 174584 KB Output is correct
22 Correct 120 ms 174584 KB Output is correct
23 Correct 118 ms 174588 KB Output is correct
24 Correct 122 ms 174072 KB Output is correct
25 Correct 129 ms 178016 KB Output is correct
26 Correct 134 ms 178016 KB Output is correct
27 Correct 128 ms 178040 KB Output is correct
28 Correct 125 ms 177276 KB Output is correct
29 Correct 134 ms 178296 KB Output is correct
30 Correct 133 ms 178424 KB Output is correct
31 Correct 131 ms 178168 KB Output is correct
32 Correct 133 ms 178168 KB Output is correct
33 Correct 236 ms 205432 KB Output is correct
34 Correct 250 ms 198648 KB Output is correct
35 Correct 208 ms 200188 KB Output is correct
36 Correct 198 ms 191992 KB Output is correct
37 Correct 324 ms 203768 KB Output is correct
38 Correct 323 ms 203804 KB Output is correct
39 Correct 323 ms 203768 KB Output is correct
40 Correct 314 ms 202676 KB Output is correct
41 Correct 215 ms 194296 KB Output is correct
42 Correct 240 ms 196856 KB Output is correct
43 Correct 346 ms 208376 KB Output is correct
44 Correct 364 ms 208760 KB Output is correct
45 Correct 231 ms 193912 KB Output is correct
46 Correct 230 ms 195220 KB Output is correct
47 Correct 335 ms 206252 KB Output is correct
48 Correct 338 ms 206328 KB Output is correct
49 Correct 115 ms 173052 KB Output is correct
50 Correct 113 ms 173048 KB Output is correct
51 Correct 114 ms 173432 KB Output is correct
52 Correct 115 ms 173048 KB Output is correct
53 Correct 116 ms 173048 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 213524 KB Output is correct
2 Correct 139 ms 207352 KB Output is correct
3 Correct 118 ms 173048 KB Output is correct
4 Correct 114 ms 173176 KB Output is correct
5 Correct 135 ms 196216 KB Output is correct
6 Correct 134 ms 196088 KB Output is correct
7 Correct 131 ms 196144 KB Output is correct
8 Correct 131 ms 194808 KB Output is correct
9 Correct 132 ms 194380 KB Output is correct
10 Correct 122 ms 183288 KB Output is correct
11 Correct 129 ms 193400 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 173052 KB Output is correct
2 Correct 745 ms 261064 KB Output is correct
3 Correct 1510 ms 335252 KB Output is correct
4 Correct 1512 ms 335992 KB Output is correct
5 Correct 1531 ms 335992 KB Output is correct
6 Correct 268 ms 197628 KB Output is correct
7 Correct 409 ms 219268 KB Output is correct
8 Correct 429 ms 222328 KB Output is correct
9 Correct 115 ms 173052 KB Output is correct
10 Correct 113 ms 173048 KB Output is correct
11 Correct 114 ms 173432 KB Output is correct
12 Correct 115 ms 173048 KB Output is correct
13 Correct 116 ms 173048 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 173048 KB Output is correct
2 Correct 115 ms 173436 KB Output is correct
3 Correct 114 ms 173432 KB Output is correct
4 Correct 117 ms 173432 KB Output is correct
5 Correct 114 ms 173048 KB Output is correct
6 Correct 115 ms 173560 KB Output is correct
7 Correct 115 ms 173304 KB Output is correct
8 Correct 114 ms 173432 KB Output is correct
9 Correct 115 ms 173560 KB Output is correct
10 Correct 114 ms 173432 KB Output is correct
11 Correct 118 ms 173636 KB Output is correct
12 Correct 117 ms 173432 KB Output is correct
13 Correct 114 ms 173052 KB Output is correct
14 Correct 113 ms 173048 KB Output is correct
15 Correct 118 ms 173092 KB Output is correct
16 Correct 114 ms 173048 KB Output is correct
17 Correct 116 ms 174580 KB Output is correct
18 Correct 117 ms 174712 KB Output is correct
19 Correct 119 ms 174584 KB Output is correct
20 Correct 117 ms 174456 KB Output is correct
21 Correct 119 ms 174584 KB Output is correct
22 Correct 120 ms 174584 KB Output is correct
23 Correct 118 ms 174588 KB Output is correct
24 Correct 122 ms 174072 KB Output is correct
25 Correct 129 ms 178016 KB Output is correct
26 Correct 134 ms 178016 KB Output is correct
27 Correct 128 ms 178040 KB Output is correct
28 Correct 125 ms 177276 KB Output is correct
29 Correct 134 ms 178296 KB Output is correct
30 Correct 133 ms 178424 KB Output is correct
31 Correct 131 ms 178168 KB Output is correct
32 Correct 133 ms 178168 KB Output is correct
33 Correct 236 ms 205432 KB Output is correct
34 Correct 250 ms 198648 KB Output is correct
35 Correct 208 ms 200188 KB Output is correct
36 Correct 198 ms 191992 KB Output is correct
37 Correct 324 ms 203768 KB Output is correct
38 Correct 323 ms 203804 KB Output is correct
39 Correct 323 ms 203768 KB Output is correct
40 Correct 314 ms 202676 KB Output is correct
41 Correct 215 ms 194296 KB Output is correct
42 Correct 240 ms 196856 KB Output is correct
43 Correct 346 ms 208376 KB Output is correct
44 Correct 364 ms 208760 KB Output is correct
45 Correct 231 ms 193912 KB Output is correct
46 Correct 230 ms 195220 KB Output is correct
47 Correct 335 ms 206252 KB Output is correct
48 Correct 338 ms 206328 KB Output is correct
49 Correct 140 ms 213524 KB Output is correct
50 Correct 139 ms 207352 KB Output is correct
51 Correct 118 ms 173048 KB Output is correct
52 Correct 114 ms 173176 KB Output is correct
53 Correct 135 ms 196216 KB Output is correct
54 Correct 134 ms 196088 KB Output is correct
55 Correct 131 ms 196144 KB Output is correct
56 Correct 131 ms 194808 KB Output is correct
57 Correct 132 ms 194380 KB Output is correct
58 Correct 122 ms 183288 KB Output is correct
59 Correct 129 ms 193400 KB Output is correct
60 Correct 119 ms 173052 KB Output is correct
61 Correct 745 ms 261064 KB Output is correct
62 Correct 1510 ms 335252 KB Output is correct
63 Correct 1512 ms 335992 KB Output is correct
64 Correct 1531 ms 335992 KB Output is correct
65 Correct 268 ms 197628 KB Output is correct
66 Correct 409 ms 219268 KB Output is correct
67 Correct 429 ms 222328 KB Output is correct
68 Correct 2029 ms 465888 KB Output is correct
69 Correct 2276 ms 404856 KB Output is correct
70 Correct 1401 ms 407416 KB Output is correct
71 Correct 1269 ms 350484 KB Output is correct
72 Correct 3194 ms 458396 KB Output is correct
73 Correct 2072 ms 389648 KB Output is correct
74 Correct 2211 ms 398168 KB Output is correct
75 Correct 3431 ms 527140 KB Output is correct
76 Correct 2128 ms 420572 KB Output is correct
77 Correct 2844 ms 464968 KB Output is correct
78 Correct 3573 ms 533552 KB Output is correct
79 Correct 1978 ms 396920 KB Output is correct
80 Correct 3572 ms 511048 KB Output is correct
81 Correct 3219 ms 500888 KB Output is correct
82 Correct 1888 ms 383608 KB Output is correct
83 Correct 3063 ms 475352 KB Output is correct
84 Correct 3073 ms 475512 KB Output is correct
85 Correct 3089 ms 475496 KB Output is correct
86 Correct 115 ms 173052 KB Output is correct
87 Correct 113 ms 173048 KB Output is correct
88 Correct 114 ms 173432 KB Output is correct
89 Correct 115 ms 173048 KB Output is correct
90 Correct 116 ms 173048 KB Output is correct