oj.uz

Submission #253943

# Submission time Handle Problem Language Result Execution time Memory
253943 2020-07-29T06:43:04 Z khangal Rectangles (IOI19_rect) C++14
72 / 100
 1126 ms 242848 KB 
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
ll sz[1234567],par[1234567],tr[3234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void add(ll x , ll val){
    for(x++; x < 2500; x += x & -x) tr[x] += val;
}
ll qry(ll x){
    ll res = 0;
    for(x++; x; x -= x & -x) res += tr[x];
    return res;
}
vector<ll> vv[2][2501];
vector<pl> vp[2];
ll aa[2][2501][2501], lst[2][2501][2501], cnt[2][2501][2501];
ll count_rectangles(vector<vector<int> > vec){
    ll n=vec.size();
    ll m=vec[0].size();
    for(ll i = 0; i < n; i++) vv[0][i].pb(0);
    for(ll i = 0; i < m; i++) vv[1][i].pb(0);
    ll res = 0;
    for(ll i = 0; i < n - 1; i++)
    for(ll j = 0; j < m - 1; j++){
        aa[0][i][j] = aa[1][j][i] = vec[i][j];
        aa[0][i][j + 1] = vec[i][j + 1];
        aa[1][j][i + 1] = vec[i + 1][j];
        for(ll t = 0; t < 2; t++){
            bool ok = 0;
            vp[t].clear();
            while(!vv[t][i].empty()){
                ll c = vv[t][i].back();
                if(c < j && !ok){
                    if(lst[t][c][j + 1] != i - 1) cnt[t][c][j + 1] = 0;
                    cnt[t][c][j + 1]++ , lst[t][c][j + 1] = i;
                    vp[t].pb({j - c, cnt[t][c][j + 1]});
                    if(t) swap(vp[t].back().ff, vp[t].back().ss);
                }
                ok = aa[t][i][c] == aa[t][i][j + 1];
                if(aa[t][i][c] <= aa[t][i][j + 1]) vv[t][i].po();
                else break;
            }
            vv[t][i].pb(j + 1);
            swap(i , j);
            sort(vp[t].rbegin(), vp[t].rend());
        }
        ll it = 0;
        for(auto u : vp[0]){
            for(; it < vp[1].size() && u.ff <= vp[1][it].ff; it++) add(vp[1][it].ss, 1);
            res += qry(u.ss);
        }
        for(ll jt = 0; jt < it; jt++) add(vp[1][jt].ss, -1);
    }
    return res;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(; it < vp[1].size() && u.ff <= vp[1][it].ff; it++) add(vp[1][it].ss, 1);
                   ~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29568 KB Output is correct
2 Correct 19 ms 30208 KB Output is correct
3 Correct 19 ms 30208 KB Output is correct
4 Correct 18 ms 30208 KB Output is correct
5 Correct 18 ms 29696 KB Output is correct
6 Correct 19 ms 30208 KB Output is correct
7 Correct 18 ms 29952 KB Output is correct
8 Correct 21 ms 29952 KB Output is correct
9 Correct 20 ms 30108 KB Output is correct
10 Correct 18 ms 30080 KB Output is correct
11 Correct 18 ms 30208 KB Output is correct
12 Correct 22 ms 30080 KB Output is correct
13 Correct 22 ms 29440 KB Output is correct
14 Correct 18 ms 29568 KB Output is correct
15 Correct 21 ms 29568 KB Output is correct
16 Correct 17 ms 29440 KB Output is correct
17 Correct 19 ms 29440 KB Output is correct
18 Correct 18 ms 29440 KB Output is correct
19 Correct 24 ms 30208 KB Output is correct
20 Correct 22 ms 29696 KB Output is correct
21 Correct 19 ms 29440 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29568 KB Output is correct
2 Correct 19 ms 30208 KB Output is correct
3 Correct 19 ms 30208 KB Output is correct
4 Correct 18 ms 30208 KB Output is correct
5 Correct 18 ms 29696 KB Output is correct
6 Correct 19 ms 30208 KB Output is correct
7 Correct 18 ms 29952 KB Output is correct
8 Correct 21 ms 29952 KB Output is correct
9 Correct 20 ms 30108 KB Output is correct
10 Correct 18 ms 30080 KB Output is correct
11 Correct 18 ms 30208 KB Output is correct
12 Correct 22 ms 30080 KB Output is correct
13 Correct 22 ms 29440 KB Output is correct
14 Correct 18 ms 29568 KB Output is correct
15 Correct 21 ms 29568 KB Output is correct
16 Correct 17 ms 29440 KB Output is correct
17 Correct 20 ms 31616 KB Output is correct
18 Correct 25 ms 31488 KB Output is correct
19 Correct 20 ms 31608 KB Output is correct
20 Correct 20 ms 31488 KB Output is correct
21 Correct 20 ms 31488 KB Output is correct
22 Correct 24 ms 31488 KB Output is correct
23 Correct 20 ms 31488 KB Output is correct
24 Correct 19 ms 30976 KB Output is correct
25 Correct 19 ms 29440 KB Output is correct
26 Correct 18 ms 29440 KB Output is correct
27 Correct 24 ms 30208 KB Output is correct
28 Correct 22 ms 29696 KB Output is correct
29 Correct 19 ms 29440 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29568 KB Output is correct
2 Correct 19 ms 30208 KB Output is correct
3 Correct 19 ms 30208 KB Output is correct
4 Correct 18 ms 30208 KB Output is correct
5 Correct 18 ms 29696 KB Output is correct
6 Correct 19 ms 30208 KB Output is correct
7 Correct 18 ms 29952 KB Output is correct
8 Correct 21 ms 29952 KB Output is correct
9 Correct 20 ms 30108 KB Output is correct
10 Correct 18 ms 30080 KB Output is correct
11 Correct 18 ms 30208 KB Output is correct
12 Correct 22 ms 30080 KB Output is correct
13 Correct 22 ms 29440 KB Output is correct
14 Correct 18 ms 29568 KB Output is correct
15 Correct 21 ms 29568 KB Output is correct
16 Correct 17 ms 29440 KB Output is correct
17 Correct 20 ms 31616 KB Output is correct
18 Correct 25 ms 31488 KB Output is correct
19 Correct 20 ms 31608 KB Output is correct
20 Correct 20 ms 31488 KB Output is correct
21 Correct 20 ms 31488 KB Output is correct
22 Correct 24 ms 31488 KB Output is correct
23 Correct 20 ms 31488 KB Output is correct
24 Correct 19 ms 30976 KB Output is correct
25 Correct 25 ms 35328 KB Output is correct
26 Correct 26 ms 35320 KB Output is correct
27 Correct 26 ms 35324 KB Output is correct
28 Correct 27 ms 34916 KB Output is correct
29 Correct 27 ms 35200 KB Output is correct
30 Correct 27 ms 35192 KB Output is correct
31 Correct 27 ms 35072 KB Output is correct
32 Correct 27 ms 34936 KB Output is correct
33 Correct 19 ms 29440 KB Output is correct
34 Correct 18 ms 29440 KB Output is correct
35 Correct 24 ms 30208 KB Output is correct
36 Correct 22 ms 29696 KB Output is correct
37 Correct 19 ms 29440 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29568 KB Output is correct
2 Correct 19 ms 30208 KB Output is correct
3 Correct 19 ms 30208 KB Output is correct
4 Correct 18 ms 30208 KB Output is correct
5 Correct 18 ms 29696 KB Output is correct
6 Correct 19 ms 30208 KB Output is correct
7 Correct 18 ms 29952 KB Output is correct
8 Correct 21 ms 29952 KB Output is correct
9 Correct 20 ms 30108 KB Output is correct
10 Correct 18 ms 30080 KB Output is correct
11 Correct 18 ms 30208 KB Output is correct
12 Correct 22 ms 30080 KB Output is correct
13 Correct 22 ms 29440 KB Output is correct
14 Correct 18 ms 29568 KB Output is correct
15 Correct 21 ms 29568 KB Output is correct
16 Correct 17 ms 29440 KB Output is correct
17 Correct 20 ms 31616 KB Output is correct
18 Correct 25 ms 31488 KB Output is correct
19 Correct 20 ms 31608 KB Output is correct
20 Correct 20 ms 31488 KB Output is correct
21 Correct 20 ms 31488 KB Output is correct
22 Correct 24 ms 31488 KB Output is correct
23 Correct 20 ms 31488 KB Output is correct
24 Correct 19 ms 30976 KB Output is correct
25 Correct 25 ms 35328 KB Output is correct
26 Correct 26 ms 35320 KB Output is correct
27 Correct 26 ms 35324 KB Output is correct
28 Correct 27 ms 34916 KB Output is correct
29 Correct 27 ms 35200 KB Output is correct
30 Correct 27 ms 35192 KB Output is correct
31 Correct 27 ms 35072 KB Output is correct
32 Correct 27 ms 34936 KB Output is correct
33 Correct 94 ms 60664 KB Output is correct
34 Correct 91 ms 60700 KB Output is correct
35 Correct 95 ms 60664 KB Output is correct
36 Correct 91 ms 60664 KB Output is correct
37 Correct 109 ms 59640 KB Output is correct
38 Correct 102 ms 59768 KB Output is correct
39 Correct 109 ms 59640 KB Output is correct
40 Correct 108 ms 58492 KB Output is correct
41 Correct 66 ms 54136 KB Output is correct
42 Correct 77 ms 54236 KB Output is correct
43 Correct 110 ms 56824 KB Output is correct
44 Correct 119 ms 57084 KB Output is correct
45 Correct 75 ms 47608 KB Output is correct
46 Correct 71 ms 47608 KB Output is correct
47 Correct 117 ms 54824 KB Output is correct
48 Correct 115 ms 54904 KB Output is correct
49 Correct 19 ms 29440 KB Output is correct
50 Correct 18 ms 29440 KB Output is correct
51 Correct 24 ms 30208 KB Output is correct
52 Correct 22 ms 29696 KB Output is correct
53 Correct 19 ms 29440 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 59768 KB Output is correct
2 Correct 32 ms 55296 KB Output is correct
3 Correct 23 ms 39680 KB Output is correct
4 Correct 18 ms 29440 KB Output is correct
5 Correct 35 ms 55168 KB Output is correct
6 Correct 33 ms 54776 KB Output is correct
7 Correct 34 ms 54912 KB Output is correct
8 Correct 33 ms 53880 KB Output is correct
9 Correct 40 ms 53752 KB Output is correct
10 Correct 18 ms 29568 KB Output is correct
11 Correct 34 ms 49920 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29696 KB Output is correct
2 Correct 298 ms 113404 KB Output is correct
3 Correct 574 ms 167800 KB Output is correct
4 Correct 558 ms 168184 KB Output is correct
5 Correct 563 ms 168292 KB Output is correct
6 Correct 185 ms 87928 KB Output is correct
7 Correct 335 ms 123000 KB Output is correct
8 Correct 381 ms 127608 KB Output is correct
9 Correct 19 ms 29440 KB Output is correct
10 Correct 18 ms 29440 KB Output is correct
11 Correct 24 ms 30208 KB Output is correct
12 Correct 22 ms 29696 KB Output is correct
13 Correct 19 ms 29440 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29568 KB Output is correct
2 Correct 19 ms 30208 KB Output is correct
3 Correct 19 ms 30208 KB Output is correct
4 Correct 18 ms 30208 KB Output is correct
5 Correct 18 ms 29696 KB Output is correct
6 Correct 19 ms 30208 KB Output is correct
7 Correct 18 ms 29952 KB Output is correct
8 Correct 21 ms 29952 KB Output is correct
9 Correct 20 ms 30108 KB Output is correct
10 Correct 18 ms 30080 KB Output is correct
11 Correct 18 ms 30208 KB Output is correct
12 Correct 22 ms 30080 KB Output is correct
13 Correct 22 ms 29440 KB Output is correct
14 Correct 18 ms 29568 KB Output is correct
15 Correct 21 ms 29568 KB Output is correct
16 Correct 17 ms 29440 KB Output is correct
17 Correct 20 ms 31616 KB Output is correct
18 Correct 25 ms 31488 KB Output is correct
19 Correct 20 ms 31608 KB Output is correct
20 Correct 20 ms 31488 KB Output is correct
21 Correct 20 ms 31488 KB Output is correct
22 Correct 24 ms 31488 KB Output is correct
23 Correct 20 ms 31488 KB Output is correct
24 Correct 19 ms 30976 KB Output is correct
25 Correct 25 ms 35328 KB Output is correct
26 Correct 26 ms 35320 KB Output is correct
27 Correct 26 ms 35324 KB Output is correct
28 Correct 27 ms 34916 KB Output is correct
29 Correct 27 ms 35200 KB Output is correct
30 Correct 27 ms 35192 KB Output is correct
31 Correct 27 ms 35072 KB Output is correct
32 Correct 27 ms 34936 KB Output is correct
33 Correct 94 ms 60664 KB Output is correct
34 Correct 91 ms 60700 KB Output is correct
35 Correct 95 ms 60664 KB Output is correct
36 Correct 91 ms 60664 KB Output is correct
37 Correct 109 ms 59640 KB Output is correct
38 Correct 102 ms 59768 KB Output is correct
39 Correct 109 ms 59640 KB Output is correct
40 Correct 108 ms 58492 KB Output is correct
41 Correct 66 ms 54136 KB Output is correct
42 Correct 77 ms 54236 KB Output is correct
43 Correct 110 ms 56824 KB Output is correct
44 Correct 119 ms 57084 KB Output is correct
45 Correct 75 ms 47608 KB Output is correct
46 Correct 71 ms 47608 KB Output is correct
47 Correct 117 ms 54824 KB Output is correct
48 Correct 115 ms 54904 KB Output is correct
49 Correct 42 ms 59768 KB Output is correct
50 Correct 32 ms 55296 KB Output is correct
51 Correct 23 ms 39680 KB Output is correct
52 Correct 18 ms 29440 KB Output is correct
53 Correct 35 ms 55168 KB Output is correct
54 Correct 33 ms 54776 KB Output is correct
55 Correct 34 ms 54912 KB Output is correct
56 Correct 33 ms 53880 KB Output is correct
57 Correct 40 ms 53752 KB Output is correct
58 Correct 18 ms 29568 KB Output is correct
59 Correct 34 ms 49920 KB Output is correct
60 Correct 20 ms 29696 KB Output is correct
61 Correct 298 ms 113404 KB Output is correct
62 Correct 574 ms 167800 KB Output is correct
63 Correct 558 ms 168184 KB Output is correct
64 Correct 563 ms 168292 KB Output is correct
65 Correct 185 ms 87928 KB Output is correct
66 Correct 335 ms 123000 KB Output is correct
67 Correct 381 ms 127608 KB Output is correct
68 Correct 921 ms 242848 KB Output is correct
69 Correct 902 ms 242296 KB Output is correct
70 Correct 993 ms 242680 KB Output is correct
71 Correct 941 ms 242720 KB Output is correct
72 Incorrect 1126 ms 239480 KB Output isn't correct
73 Halted 0 ms 0 KB -