oj.uz

Submission #654115

# Submission time Handle Problem Language Result Execution time Memory
654115 2022-10-30T03:11:42 Z jiahng Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 130564 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef pair <pi,pi> pipi;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 2501
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int N,M;
set <pi> hpairs[maxn], vpairs[maxn];
long long count_rectangles(std::vector<std::vector<int> > a) {
    N = a.size(); M = a[0].size();

    FOR(i,0,N-1){
        stack <pi> st;
        FOR(j,0,M-1){
            while (!st.empty() && st.top().f < a[i][j]) st.pop();
            if (!st.empty() && j - st.top().s + 1 >= 3) hpairs[i].insert(pi(st.top().s+1, j-1)); 
            st.push(pi(a[i][j], j));
        }
        while (!st.empty()) st.pop();
        DEC(j,M-1,0){
            while (!st.empty() && st.top().f < a[i][j]) st.pop();
            if (!st.empty() && st.top().s - j + 1 >= 3) hpairs[i].insert(pi(j+1, st.top().s-1));
            st.push(pi(a[i][j], j));
        }
    }

    FOR(j,0,M-1){
        stack <pi> st;
        FOR(i,0,N-1){
            while (!st.empty() && st.top().f < a[i][j]) st.pop();
            if (!st.empty() && i - st.top().s + 1 >= 3) vpairs[j].insert(pi(st.top().s+1, i-1)); 
            st.push(pi(a[i][j], i));
        }
        while (!st.empty()) st.pop();
        DEC(i,N-1,0){
            while (!st.empty() && st.top().f < a[i][j]) st.pop();
            if (!st.empty() && st.top().s - i + 1 >= 3) vpairs[j].insert(pi(i+1, st.top().s-1));
            st.push(pi(a[i][j], i));
        }
    }

    /*
    cout << "HPAIRS: \n";
    FOR(i,0,N-1){
        cout << "ROW " << i << '\n';
        aFOR(j, hpairs[i]) cout << j.f << ' ' << j.s << '\n';
    }
    cout << "VPAIRS: \n";
    FOR(i,0,M-1){
        cout << "COL " << i << '\n';
        aFOR(j, vpairs[i]) cout << j.f << ' ' << j.s << '\n';
    }
    */

    vector <pipi> hrects, vrects;
    FOR(i,0,N-1){
        aFOR(j, hpairs[i]){
            int a = i, b = j.f, c = N - 1, d = j.s;
            FOR(k,i+1,N-1){
                if (hpairs[k].count(j)){
                    hpairs[k].erase(j);
                }else{
                    c = k - 1;
                    break;
                }
            }
            hrects.pb(pipi(pi(a,b), pi(c,d)));
        }
    }

    FOR(i,0,M-1){
        aFOR(j, vpairs[i]){
            int a = j.f, b = i, c = j.s, d = M - 1;
            FOR(k,i+1,M-1){
                if (vpairs[k].count(j)){
                    vpairs[k].erase(j);
                }else{
                    d = k - 1;
                    break;
                }
            }
            vrects.pb(pipi(pi(a,b), pi(c,d)));
        }
    }
    /*
    cout << "HRECTS: \n";
    aFOR(i, hrects) cout << i.f.f << ' ' << i.f.s << ' ' << i.s.f << ' ' << i.s.s << '\n';
    cout << "VRECTS: \n";
    aFOR(i, vrects) cout << i.f.f << ' ' << i.f.s << ' ' << i.s.f << ' ' << i.s.s << '\n';
    */

    int ans = 0;
    aFOR(i, hrects) aFOR(j, vrects){
        if (!(i.f.f <= j.f.f && j.s.f <= i.s.f)) continue;
        if (!(j.f.s <= i.f.s && i.s.s <= j.s.s)) continue;
        //cout << i.f.f << ' ' << i.f.s << ' ' << i.s.f << ' ' << i.s.s << '\n';
        //cout << j.f.f << ' ' << j.f.s << ' ' << j.s.f << ' ' << j.s.s << '\n' << '\n';
        ans++;
    }
    return ans;


}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 536 KB Output is correct
21 Correct 1 ms 468 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 536 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 3 ms 1184 KB Output is correct
24 Correct 3 ms 1108 KB Output is correct
25 Correct 8 ms 940 KB Output is correct
26 Correct 32 ms 1400 KB Output is correct
27 Correct 40 ms 1432 KB Output is correct
28 Correct 34 ms 1364 KB Output is correct
29 Correct 5 ms 928 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1184 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 8 ms 940 KB Output is correct
21 Correct 32 ms 1400 KB Output is correct
22 Correct 40 ms 1432 KB Output is correct
23 Correct 34 ms 1364 KB Output is correct
24 Correct 5 ms 928 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 536 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 19 ms 4776 KB Output is correct
31 Correct 18 ms 4692 KB Output is correct
32 Correct 18 ms 4820 KB Output is correct
33 Correct 277 ms 2960 KB Output is correct
34 Correct 1207 ms 5788 KB Output is correct
35 Correct 1289 ms 5900 KB Output is correct
36 Correct 832 ms 5496 KB Output is correct
37 Correct 858 ms 5500 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1184 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 8 ms 940 KB Output is correct
21 Correct 32 ms 1400 KB Output is correct
22 Correct 40 ms 1432 KB Output is correct
23 Correct 34 ms 1364 KB Output is correct
24 Correct 5 ms 928 KB Output is correct
25 Correct 19 ms 4776 KB Output is correct
26 Correct 18 ms 4692 KB Output is correct
27 Correct 18 ms 4820 KB Output is correct
28 Correct 277 ms 2960 KB Output is correct
29 Correct 1207 ms 5788 KB Output is correct
30 Correct 1289 ms 5900 KB Output is correct
31 Correct 832 ms 5496 KB Output is correct
32 Correct 858 ms 5500 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 536 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Execution timed out 5009 ms 40508 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 11 ms 1108 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 9 ms 1108 KB Output is correct
8 Correct 9 ms 1108 KB Output is correct
9 Correct 7 ms 1108 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 3 ms 980 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Execution timed out 5024 ms 130564 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1184 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 8 ms 940 KB Output is correct
21 Correct 32 ms 1400 KB Output is correct
22 Correct 40 ms 1432 KB Output is correct
23 Correct 34 ms 1364 KB Output is correct
24 Correct 5 ms 928 KB Output is correct
25 Correct 19 ms 4776 KB Output is correct
26 Correct 18 ms 4692 KB Output is correct
27 Correct 18 ms 4820 KB Output is correct
28 Correct 277 ms 2960 KB Output is correct
29 Correct 1207 ms 5788 KB Output is correct
30 Correct 1289 ms 5900 KB Output is correct
31 Correct 832 ms 5496 KB Output is correct
32 Correct 858 ms 5500 KB Output is correct
33 Execution timed out 5009 ms 40508 KB Time limit exceeded
34 Halted 0 ms 0 KB -