oj.uz

Submission #207916

# Submission time Handle Problem Language Result Execution time Memory
207916 2020-03-09T12:16:03 Z balbit Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1032920 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int MX = 2505;

vector<pii> hof[MX][MX], cof[MX][MX];
#define REP(i,n) for (int i = 0; i<n; i++)
#define FOR(i,a,b) for (int i = a; i<b; i++)

vector<int> g[MX][MX];

void go(vector<pii> up[MX][MX], vector<vector<int> > &a) {
    int n = a.size(), m = a[0].size();
    REP(i,m) REP(j,m) g[i][j] . clear();
    REP(i,n) {
        vector<int> &b = a[i];
        stack<pii> how; how.push({b[0], 0});
        FOR(j,1,m) {
            while (!how.empty() && how.top().f < b[j]) {
                g[how.top().s][j].pb(i);
                how.pop();
            }
            if (!how.empty()) {
                g[how.top().s][j].pb(i);
            }
            while (!how.empty() && how.top().f == b[j]) how.pop();
            how.push({b[j],j});
        }
    }
    REP(i,m-1) FOR(j,i+2,m) {
        if (SZ(g[i][j]) == 0) continue;
        sort(ALL(g[i][j]));
        int first = 0;
        REP(it, SZ(g[i][j]) + 1) {
            if (it == SZ(g[i][j]) || (it!=0 && g[i][j][it] != g[i][j][it-1]+1)) {
                FOR(nat, first, it) if (g[i][j][nat] -1 >= 0) up[max(g[i][j][nat]-1,0)][i].pb({g[i][j][it-1]+1,j});
                first = it;
            }
        }
    }
}

int s[MX];
ll QU(int e) {
    ll re = 0;
    for (e++; e>0; e-=e&-e) re += s[e];
    return re;
}
void MO(int e, int v) {
    for (e++; e<MX; e+=e&-e) s[e] += v;
}

ll count_rectangles(vector<vector<int> > a){
    go(hof,a);
    int n = a.size(), m = a[0].size();
#ifdef BALBIT
    REP(i,n) REP(j,m) {
        if (SZ(hof[i][j]) == 0) continue;
        bug(i,j);
        for (pii x : hof[i][j]) {
            cerr<<x.f<<' '<<x.s<<"\n";
        }
        cerr<<endl;
    }
#endif
    vector<vector<int> > aT(m);
    REP(j,m) {
        REP(i,n) {
            aT[j].pb(a[i][j]);
        }
    }
    go(cof, aT);
    REP(i,n) REP(j,m) {
        for (pii & x : cof[j][i]) {
            swap(x.f, x.s);
        }
    }
#ifdef BALBIT
    REP(i,n) REP(j,m) {
        if (SZ(cof[i][j]) == 0) continue;
        bug(i,j, j,i);
        for (pii x : cof[j][i]) {
            cerr<<x.f<<' '<<x.s<<"\n";
        }
        cerr<<endl;
    }
#endif
    ll re = 0;
    REP(i,n-2) REP(j,m-2) {
        vector<pii> ud = hof[i][j], lr = cof[j][i];
        if (ud.size() == 0 || lr.size() == 0) continue;
        sort(ALL(ud), greater<pii> ());
        sort(ALL(lr), greater<pii> ());
        int it = 0;
        for (pii & q : lr) {
            while (it < SZ(ud) && ud[it].f >= q.f) {
                MO(ud[it].s,1);
                ++it;
            }
            re += QU(q.s);
            bug(q.s,it,QU(q.s));
        }
        REP(jt, it) {
            MO(ud[jt].s,-1);
        }
    }
    return re;
}

#ifdef BALBIT
signed main(){
    IOS();
//    ll lol = count_rectangles({{0,5,5,0},{5,2,2,5},{5,3,4,5}});
//    bug(lol);
    ll lol = count_rectangles({{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}});
    bug(lol);
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 442360 KB Output is correct
2 Correct 272 ms 442488 KB Output is correct
3 Correct 271 ms 442488 KB Output is correct
4 Correct 271 ms 442616 KB Output is correct
5 Correct 269 ms 442364 KB Output is correct
6 Correct 272 ms 442488 KB Output is correct
7 Correct 269 ms 442360 KB Output is correct
8 Correct 273 ms 442360 KB Output is correct
9 Correct 289 ms 442488 KB Output is correct
10 Correct 271 ms 442488 KB Output is correct
11 Correct 275 ms 442488 KB Output is correct
12 Correct 287 ms 442488 KB Output is correct
13 Correct 279 ms 442392 KB Output is correct
14 Correct 263 ms 442360 KB Output is correct
15 Correct 265 ms 442360 KB Output is correct
16 Correct 261 ms 442360 KB Output is correct
17 Correct 266 ms 442336 KB Output is correct
18 Correct 279 ms 442332 KB Output is correct
19 Correct 270 ms 442360 KB Output is correct
20 Correct 261 ms 442360 KB Output is correct
21 Correct 268 ms 442360 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 442360 KB Output is correct
2 Correct 272 ms 442488 KB Output is correct
3 Correct 271 ms 442488 KB Output is correct
4 Correct 271 ms 442616 KB Output is correct
5 Correct 269 ms 442364 KB Output is correct
6 Correct 272 ms 442488 KB Output is correct
7 Correct 269 ms 442360 KB Output is correct
8 Correct 273 ms 442360 KB Output is correct
9 Correct 289 ms 442488 KB Output is correct
10 Correct 271 ms 442488 KB Output is correct
11 Correct 275 ms 442488 KB Output is correct
12 Correct 287 ms 442488 KB Output is correct
13 Correct 279 ms 442392 KB Output is correct
14 Correct 263 ms 442360 KB Output is correct
15 Correct 265 ms 442360 KB Output is correct
16 Correct 261 ms 442360 KB Output is correct
17 Correct 279 ms 442976 KB Output is correct
18 Correct 283 ms 443016 KB Output is correct
19 Correct 271 ms 443000 KB Output is correct
20 Correct 264 ms 442744 KB Output is correct
21 Correct 266 ms 443000 KB Output is correct
22 Correct 273 ms 442872 KB Output is correct
23 Correct 267 ms 442872 KB Output is correct
24 Correct 270 ms 442792 KB Output is correct
25 Correct 266 ms 442336 KB Output is correct
26 Correct 279 ms 442332 KB Output is correct
27 Correct 270 ms 442360 KB Output is correct
28 Correct 261 ms 442360 KB Output is correct
29 Correct 268 ms 442360 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 442360 KB Output is correct
2 Correct 272 ms 442488 KB Output is correct
3 Correct 271 ms 442488 KB Output is correct
4 Correct 271 ms 442616 KB Output is correct
5 Correct 269 ms 442364 KB Output is correct
6 Correct 272 ms 442488 KB Output is correct
7 Correct 269 ms 442360 KB Output is correct
8 Correct 273 ms 442360 KB Output is correct
9 Correct 289 ms 442488 KB Output is correct
10 Correct 271 ms 442488 KB Output is correct
11 Correct 275 ms 442488 KB Output is correct
12 Correct 287 ms 442488 KB Output is correct
13 Correct 279 ms 442392 KB Output is correct
14 Correct 263 ms 442360 KB Output is correct
15 Correct 265 ms 442360 KB Output is correct
16 Correct 261 ms 442360 KB Output is correct
17 Correct 279 ms 442976 KB Output is correct
18 Correct 283 ms 443016 KB Output is correct
19 Correct 271 ms 443000 KB Output is correct
20 Correct 264 ms 442744 KB Output is correct
21 Correct 266 ms 443000 KB Output is correct
22 Correct 273 ms 442872 KB Output is correct
23 Correct 267 ms 442872 KB Output is correct
24 Correct 270 ms 442792 KB Output is correct
25 Correct 287 ms 446052 KB Output is correct
26 Correct 291 ms 446072 KB Output is correct
27 Correct 289 ms 446072 KB Output is correct
28 Correct 279 ms 444252 KB Output is correct
29 Correct 290 ms 445176 KB Output is correct
30 Correct 284 ms 445304 KB Output is correct
31 Correct 291 ms 445232 KB Output is correct
32 Correct 293 ms 445048 KB Output is correct
33 Correct 266 ms 442336 KB Output is correct
34 Correct 279 ms 442332 KB Output is correct
35 Correct 270 ms 442360 KB Output is correct
36 Correct 261 ms 442360 KB Output is correct
37 Correct 268 ms 442360 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 442360 KB Output is correct
2 Correct 272 ms 442488 KB Output is correct
3 Correct 271 ms 442488 KB Output is correct
4 Correct 271 ms 442616 KB Output is correct
5 Correct 269 ms 442364 KB Output is correct
6 Correct 272 ms 442488 KB Output is correct
7 Correct 269 ms 442360 KB Output is correct
8 Correct 273 ms 442360 KB Output is correct
9 Correct 289 ms 442488 KB Output is correct
10 Correct 271 ms 442488 KB Output is correct
11 Correct 275 ms 442488 KB Output is correct
12 Correct 287 ms 442488 KB Output is correct
13 Correct 279 ms 442392 KB Output is correct
14 Correct 263 ms 442360 KB Output is correct
15 Correct 265 ms 442360 KB Output is correct
16 Correct 261 ms 442360 KB Output is correct
17 Correct 279 ms 442976 KB Output is correct
18 Correct 283 ms 443016 KB Output is correct
19 Correct 271 ms 443000 KB Output is correct
20 Correct 264 ms 442744 KB Output is correct
21 Correct 266 ms 443000 KB Output is correct
22 Correct 273 ms 442872 KB Output is correct
23 Correct 267 ms 442872 KB Output is correct
24 Correct 270 ms 442792 KB Output is correct
25 Correct 287 ms 446052 KB Output is correct
26 Correct 291 ms 446072 KB Output is correct
27 Correct 289 ms 446072 KB Output is correct
28 Correct 279 ms 444252 KB Output is correct
29 Correct 290 ms 445176 KB Output is correct
30 Correct 284 ms 445304 KB Output is correct
31 Correct 291 ms 445232 KB Output is correct
32 Correct 293 ms 445048 KB Output is correct
33 Correct 525 ms 477972 KB Output is correct
34 Correct 455 ms 473336 KB Output is correct
35 Correct 470 ms 473208 KB Output is correct
36 Correct 406 ms 468680 KB Output is correct
37 Correct 579 ms 488496 KB Output is correct
38 Correct 583 ms 491352 KB Output is correct
39 Correct 579 ms 488824 KB Output is correct
40 Correct 556 ms 489080 KB Output is correct
41 Correct 418 ms 461304 KB Output is correct
42 Correct 454 ms 464504 KB Output is correct
43 Correct 589 ms 475520 KB Output is correct
44 Correct 599 ms 477816 KB Output is correct
45 Correct 434 ms 461560 KB Output is correct
46 Correct 434 ms 461304 KB Output is correct
47 Correct 596 ms 474748 KB Output is correct
48 Correct 588 ms 475768 KB Output is correct
49 Correct 266 ms 442336 KB Output is correct
50 Correct 279 ms 442332 KB Output is correct
51 Correct 270 ms 442360 KB Output is correct
52 Correct 261 ms 442360 KB Output is correct
53 Correct 268 ms 442360 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 443128 KB Output is correct
2 Correct 287 ms 443000 KB Output is correct
3 Correct 298 ms 442744 KB Output is correct
4 Correct 275 ms 442504 KB Output is correct
5 Correct 287 ms 443000 KB Output is correct
6 Correct 297 ms 443128 KB Output is correct
7 Correct 291 ms 443128 KB Output is correct
8 Correct 294 ms 443256 KB Output is correct
9 Correct 289 ms 443000 KB Output is correct
10 Correct 285 ms 442744 KB Output is correct
11 Correct 300 ms 442904 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 442360 KB Output is correct
2 Correct 1541 ms 568248 KB Output is correct
3 Correct 3202 ms 682892 KB Output is correct
4 Correct 3184 ms 683648 KB Output is correct
5 Correct 3220 ms 684040 KB Output is correct
6 Correct 1077 ms 521180 KB Output is correct
7 Correct 1920 ms 569952 KB Output is correct
8 Correct 1999 ms 575776 KB Output is correct
9 Correct 266 ms 442336 KB Output is correct
10 Correct 279 ms 442332 KB Output is correct
11 Correct 270 ms 442360 KB Output is correct
12 Correct 261 ms 442360 KB Output is correct
13 Correct 268 ms 442360 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 442360 KB Output is correct
2 Correct 272 ms 442488 KB Output is correct
3 Correct 271 ms 442488 KB Output is correct
4 Correct 271 ms 442616 KB Output is correct
5 Correct 269 ms 442364 KB Output is correct
6 Correct 272 ms 442488 KB Output is correct
7 Correct 269 ms 442360 KB Output is correct
8 Correct 273 ms 442360 KB Output is correct
9 Correct 289 ms 442488 KB Output is correct
10 Correct 271 ms 442488 KB Output is correct
11 Correct 275 ms 442488 KB Output is correct
12 Correct 287 ms 442488 KB Output is correct
13 Correct 279 ms 442392 KB Output is correct
14 Correct 263 ms 442360 KB Output is correct
15 Correct 265 ms 442360 KB Output is correct
16 Correct 261 ms 442360 KB Output is correct
17 Correct 279 ms 442976 KB Output is correct
18 Correct 283 ms 443016 KB Output is correct
19 Correct 271 ms 443000 KB Output is correct
20 Correct 264 ms 442744 KB Output is correct
21 Correct 266 ms 443000 KB Output is correct
22 Correct 273 ms 442872 KB Output is correct
23 Correct 267 ms 442872 KB Output is correct
24 Correct 270 ms 442792 KB Output is correct
25 Correct 287 ms 446052 KB Output is correct
26 Correct 291 ms 446072 KB Output is correct
27 Correct 289 ms 446072 KB Output is correct
28 Correct 279 ms 444252 KB Output is correct
29 Correct 290 ms 445176 KB Output is correct
30 Correct 284 ms 445304 KB Output is correct
31 Correct 291 ms 445232 KB Output is correct
32 Correct 293 ms 445048 KB Output is correct
33 Correct 525 ms 477972 KB Output is correct
34 Correct 455 ms 473336 KB Output is correct
35 Correct 470 ms 473208 KB Output is correct
36 Correct 406 ms 468680 KB Output is correct
37 Correct 579 ms 488496 KB Output is correct
38 Correct 583 ms 491352 KB Output is correct
39 Correct 579 ms 488824 KB Output is correct
40 Correct 556 ms 489080 KB Output is correct
41 Correct 418 ms 461304 KB Output is correct
42 Correct 454 ms 464504 KB Output is correct
43 Correct 589 ms 475520 KB Output is correct
44 Correct 599 ms 477816 KB Output is correct
45 Correct 434 ms 461560 KB Output is correct
46 Correct 434 ms 461304 KB Output is correct
47 Correct 596 ms 474748 KB Output is correct
48 Correct 588 ms 475768 KB Output is correct
49 Correct 304 ms 443128 KB Output is correct
50 Correct 287 ms 443000 KB Output is correct
51 Correct 298 ms 442744 KB Output is correct
52 Correct 275 ms 442504 KB Output is correct
53 Correct 287 ms 443000 KB Output is correct
54 Correct 297 ms 443128 KB Output is correct
55 Correct 291 ms 443128 KB Output is correct
56 Correct 294 ms 443256 KB Output is correct
57 Correct 289 ms 443000 KB Output is correct
58 Correct 285 ms 442744 KB Output is correct
59 Correct 300 ms 442904 KB Output is correct
60 Correct 265 ms 442360 KB Output is correct
61 Correct 1541 ms 568248 KB Output is correct
62 Correct 3202 ms 682892 KB Output is correct
63 Correct 3184 ms 683648 KB Output is correct
64 Correct 3220 ms 684040 KB Output is correct
65 Correct 1077 ms 521180 KB Output is correct
66 Correct 1920 ms 569952 KB Output is correct
67 Correct 1999 ms 575776 KB Output is correct
68 Correct 4988 ms 903664 KB Output is correct
69 Correct 3600 ms 836600 KB Output is correct
70 Correct 4197 ms 836928 KB Output is correct
71 Correct 2747 ms 769468 KB Output is correct
72 Execution timed out 5134 ms 1032920 KB Time limit exceeded
73 Halted 0 ms 0 KB -