oj.uz

Submission #288774

# Submission time Handle Problem Language Result Execution time Memory
288774 2020-09-01T21:21:25 Z Aaeria Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 966908 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<int> mx;
unordered_map<pii,short,chash> xs[N],ys[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();
        forj(1,m+1) if(1<ml[j]&&mr[j]<m) xs[i][mp(ml[j],mr[j]-ml[j]+1)]=xs[i+1][mp(ml[j],mr[j]-ml[j]+1)]+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();
        forj(1,n+1) if(1<ml[j]&&mr[j]<n) ys[i][mp(ml[j],mr[j]-ml[j]+1)]=ys[i+1][mp(ml[j],mr[j]-ml[j]+1)]+1;
    }
    forj(1,n+1) for(auto i:xs[j]) if(i.ps) xy[j][i.pf.pf].pb({i.ps,1,i.pf.ps});
    forj(1,m+1) for(auto i:ys[j]) if(i.ps) xy[i.pf.pf][j].pb({i.pf.ps,0,i.ps});
    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 '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 107 ms 173176 KB Output is correct
2 Correct 115 ms 173304 KB Output is correct
3 Correct 111 ms 173308 KB Output is correct
4 Correct 109 ms 173304 KB Output is correct
5 Correct 107 ms 173308 KB Output is correct
6 Correct 109 ms 173304 KB Output is correct
7 Correct 109 ms 173304 KB Output is correct
8 Correct 116 ms 173304 KB Output is correct
9 Correct 116 ms 173304 KB Output is correct
10 Correct 112 ms 173304 KB Output is correct
11 Correct 112 ms 173304 KB Output is correct
12 Correct 113 ms 173304 KB Output is correct
13 Correct 112 ms 173180 KB Output is correct
14 Correct 111 ms 173176 KB Output is correct
15 Correct 116 ms 173176 KB Output is correct
16 Correct 121 ms 173176 KB Output is correct
17 Correct 110 ms 173176 KB Output is correct
18 Correct 112 ms 173176 KB Output is correct
19 Correct 111 ms 173304 KB Output is correct
20 Correct 110 ms 173176 KB Output is correct
21 Correct 110 ms 173176 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 173176 KB Output is correct
2 Correct 115 ms 173304 KB Output is correct
3 Correct 111 ms 173308 KB Output is correct
4 Correct 109 ms 173304 KB Output is correct
5 Correct 107 ms 173308 KB Output is correct
6 Correct 109 ms 173304 KB Output is correct
7 Correct 109 ms 173304 KB Output is correct
8 Correct 116 ms 173304 KB Output is correct
9 Correct 116 ms 173304 KB Output is correct
10 Correct 112 ms 173304 KB Output is correct
11 Correct 112 ms 173304 KB Output is correct
12 Correct 113 ms 173304 KB Output is correct
13 Correct 112 ms 173180 KB Output is correct
14 Correct 111 ms 173176 KB Output is correct
15 Correct 116 ms 173176 KB Output is correct
16 Correct 121 ms 173176 KB Output is correct
17 Correct 116 ms 173944 KB Output is correct
18 Correct 113 ms 174072 KB Output is correct
19 Correct 117 ms 173944 KB Output is correct
20 Correct 114 ms 173816 KB Output is correct
21 Correct 117 ms 174456 KB Output is correct
22 Correct 115 ms 174460 KB Output is correct
23 Correct 115 ms 174328 KB Output is correct
24 Correct 111 ms 173692 KB Output is correct
25 Correct 110 ms 173176 KB Output is correct
26 Correct 112 ms 173176 KB Output is correct
27 Correct 111 ms 173304 KB Output is correct
28 Correct 110 ms 173176 KB Output is correct
29 Correct 110 ms 173176 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 173176 KB Output is correct
2 Correct 115 ms 173304 KB Output is correct
3 Correct 111 ms 173308 KB Output is correct
4 Correct 109 ms 173304 KB Output is correct
5 Correct 107 ms 173308 KB Output is correct
6 Correct 109 ms 173304 KB Output is correct
7 Correct 109 ms 173304 KB Output is correct
8 Correct 116 ms 173304 KB Output is correct
9 Correct 116 ms 173304 KB Output is correct
10 Correct 112 ms 173304 KB Output is correct
11 Correct 112 ms 173304 KB Output is correct
12 Correct 113 ms 173304 KB Output is correct
13 Correct 112 ms 173180 KB Output is correct
14 Correct 111 ms 173176 KB Output is correct
15 Correct 116 ms 173176 KB Output is correct
16 Correct 121 ms 173176 KB Output is correct
17 Correct 116 ms 173944 KB Output is correct
18 Correct 113 ms 174072 KB Output is correct
19 Correct 117 ms 173944 KB Output is correct
20 Correct 114 ms 173816 KB Output is correct
21 Correct 117 ms 174456 KB Output is correct
22 Correct 115 ms 174460 KB Output is correct
23 Correct 115 ms 174328 KB Output is correct
24 Correct 111 ms 173692 KB Output is correct
25 Correct 135 ms 178168 KB Output is correct
26 Correct 142 ms 178168 KB Output is correct
27 Correct 136 ms 178168 KB Output is correct
28 Correct 130 ms 176760 KB Output is correct
29 Correct 155 ms 180728 KB Output is correct
30 Correct 155 ms 180984 KB Output is correct
31 Correct 161 ms 180220 KB Output is correct
32 Correct 148 ms 180216 KB Output is correct
33 Correct 110 ms 173176 KB Output is correct
34 Correct 112 ms 173176 KB Output is correct
35 Correct 111 ms 173304 KB Output is correct
36 Correct 110 ms 173176 KB Output is correct
37 Correct 110 ms 173176 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 173176 KB Output is correct
2 Correct 115 ms 173304 KB Output is correct
3 Correct 111 ms 173308 KB Output is correct
4 Correct 109 ms 173304 KB Output is correct
5 Correct 107 ms 173308 KB Output is correct
6 Correct 109 ms 173304 KB Output is correct
7 Correct 109 ms 173304 KB Output is correct
8 Correct 116 ms 173304 KB Output is correct
9 Correct 116 ms 173304 KB Output is correct
10 Correct 112 ms 173304 KB Output is correct
11 Correct 112 ms 173304 KB Output is correct
12 Correct 113 ms 173304 KB Output is correct
13 Correct 112 ms 173180 KB Output is correct
14 Correct 111 ms 173176 KB Output is correct
15 Correct 116 ms 173176 KB Output is correct
16 Correct 121 ms 173176 KB Output is correct
17 Correct 116 ms 173944 KB Output is correct
18 Correct 113 ms 174072 KB Output is correct
19 Correct 117 ms 173944 KB Output is correct
20 Correct 114 ms 173816 KB Output is correct
21 Correct 117 ms 174456 KB Output is correct
22 Correct 115 ms 174460 KB Output is correct
23 Correct 115 ms 174328 KB Output is correct
24 Correct 111 ms 173692 KB Output is correct
25 Correct 135 ms 178168 KB Output is correct
26 Correct 142 ms 178168 KB Output is correct
27 Correct 136 ms 178168 KB Output is correct
28 Correct 130 ms 176760 KB Output is correct
29 Correct 155 ms 180728 KB Output is correct
30 Correct 155 ms 180984 KB Output is correct
31 Correct 161 ms 180220 KB Output is correct
32 Correct 148 ms 180216 KB Output is correct
33 Correct 435 ms 237436 KB Output is correct
34 Correct 420 ms 234104 KB Output is correct
35 Correct 393 ms 234232 KB Output is correct
36 Correct 391 ms 230136 KB Output is correct
37 Correct 491 ms 235384 KB Output is correct
38 Correct 491 ms 235384 KB Output is correct
39 Correct 494 ms 235768 KB Output is correct
40 Correct 460 ms 232056 KB Output is correct
41 Correct 320 ms 203000 KB Output is correct
42 Correct 399 ms 217984 KB Output is correct
43 Correct 690 ms 271692 KB Output is correct
44 Correct 700 ms 274424 KB Output is correct
45 Correct 399 ms 223228 KB Output is correct
46 Correct 412 ms 223224 KB Output is correct
47 Correct 657 ms 262520 KB Output is correct
48 Correct 662 ms 263928 KB Output is correct
49 Correct 110 ms 173176 KB Output is correct
50 Correct 112 ms 173176 KB Output is correct
51 Correct 111 ms 173304 KB Output is correct
52 Correct 110 ms 173176 KB Output is correct
53 Correct 110 ms 173176 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 174200 KB Output is correct
2 Correct 118 ms 174072 KB Output is correct
3 Correct 114 ms 173304 KB Output is correct
4 Correct 120 ms 173304 KB Output is correct
5 Correct 119 ms 174200 KB Output is correct
6 Correct 119 ms 174200 KB Output is correct
7 Correct 120 ms 174200 KB Output is correct
8 Correct 120 ms 174200 KB Output is correct
9 Correct 121 ms 174200 KB Output is correct
10 Correct 123 ms 173560 KB Output is correct
11 Correct 110 ms 173820 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 173176 KB Output is correct
2 Correct 1383 ms 350176 KB Output is correct
3 Correct 2979 ms 561600 KB Output is correct
4 Correct 2970 ms 563460 KB Output is correct
5 Correct 2956 ms 563568 KB Output is correct
6 Correct 239 ms 203644 KB Output is correct
7 Correct 418 ms 230776 KB Output is correct
8 Correct 432 ms 234488 KB Output is correct
9 Correct 110 ms 173176 KB Output is correct
10 Correct 112 ms 173176 KB Output is correct
11 Correct 111 ms 173304 KB Output is correct
12 Correct 110 ms 173176 KB Output is correct
13 Correct 110 ms 173176 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 173176 KB Output is correct
2 Correct 115 ms 173304 KB Output is correct
3 Correct 111 ms 173308 KB Output is correct
4 Correct 109 ms 173304 KB Output is correct
5 Correct 107 ms 173308 KB Output is correct
6 Correct 109 ms 173304 KB Output is correct
7 Correct 109 ms 173304 KB Output is correct
8 Correct 116 ms 173304 KB Output is correct
9 Correct 116 ms 173304 KB Output is correct
10 Correct 112 ms 173304 KB Output is correct
11 Correct 112 ms 173304 KB Output is correct
12 Correct 113 ms 173304 KB Output is correct
13 Correct 112 ms 173180 KB Output is correct
14 Correct 111 ms 173176 KB Output is correct
15 Correct 116 ms 173176 KB Output is correct
16 Correct 121 ms 173176 KB Output is correct
17 Correct 116 ms 173944 KB Output is correct
18 Correct 113 ms 174072 KB Output is correct
19 Correct 117 ms 173944 KB Output is correct
20 Correct 114 ms 173816 KB Output is correct
21 Correct 117 ms 174456 KB Output is correct
22 Correct 115 ms 174460 KB Output is correct
23 Correct 115 ms 174328 KB Output is correct
24 Correct 111 ms 173692 KB Output is correct
25 Correct 135 ms 178168 KB Output is correct
26 Correct 142 ms 178168 KB Output is correct
27 Correct 136 ms 178168 KB Output is correct
28 Correct 130 ms 176760 KB Output is correct
29 Correct 155 ms 180728 KB Output is correct
30 Correct 155 ms 180984 KB Output is correct
31 Correct 161 ms 180220 KB Output is correct
32 Correct 148 ms 180216 KB Output is correct
33 Correct 435 ms 237436 KB Output is correct
34 Correct 420 ms 234104 KB Output is correct
35 Correct 393 ms 234232 KB Output is correct
36 Correct 391 ms 230136 KB Output is correct
37 Correct 491 ms 235384 KB Output is correct
38 Correct 491 ms 235384 KB Output is correct
39 Correct 494 ms 235768 KB Output is correct
40 Correct 460 ms 232056 KB Output is correct
41 Correct 320 ms 203000 KB Output is correct
42 Correct 399 ms 217984 KB Output is correct
43 Correct 690 ms 271692 KB Output is correct
44 Correct 700 ms 274424 KB Output is correct
45 Correct 399 ms 223228 KB Output is correct
46 Correct 412 ms 223224 KB Output is correct
47 Correct 657 ms 262520 KB Output is correct
48 Correct 662 ms 263928 KB Output is correct
49 Correct 118 ms 174200 KB Output is correct
50 Correct 118 ms 174072 KB Output is correct
51 Correct 114 ms 173304 KB Output is correct
52 Correct 120 ms 173304 KB Output is correct
53 Correct 119 ms 174200 KB Output is correct
54 Correct 119 ms 174200 KB Output is correct
55 Correct 120 ms 174200 KB Output is correct
56 Correct 120 ms 174200 KB Output is correct
57 Correct 121 ms 174200 KB Output is correct
58 Correct 123 ms 173560 KB Output is correct
59 Correct 110 ms 173820 KB Output is correct
60 Correct 106 ms 173176 KB Output is correct
61 Correct 1383 ms 350176 KB Output is correct
62 Correct 2979 ms 561600 KB Output is correct
63 Correct 2970 ms 563460 KB Output is correct
64 Correct 2956 ms 563568 KB Output is correct
65 Correct 239 ms 203644 KB Output is correct
66 Correct 418 ms 230776 KB Output is correct
67 Correct 432 ms 234488 KB Output is correct
68 Execution timed out 5093 ms 966908 KB Time limit exceeded
69 Halted 0 ms 0 KB -