oj.uz

Submission #145383

# Submission time Handle Problem Language Result Execution time Memory
145383 2019-08-19T18:37:26 Z jacynkaa Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 760532 KB 
#include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
#pragma GCC optimize("-O3")
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10) //cin.tie(0); cout.tie(0);
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FWD(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define all(c) (c).begin(), (c).end()
#define what(x) cerr << #x << " is " << x << endl;

const int MAXN = 2505; //UWAGA

vector<int> prawo[MAXN][MAXN];
vector<int> dol[MAXN][MAXN];
vector<pii> R[MAXN][MAXN];
vector<pii> D[MAXN][MAXN];
int n, m;
int tab[MAXN][MAXN];
long long ans = 0;

vector<pair<pii, pii>> odp;

void wypisz()
{
    sort(all(odp));
    for (auto a : odp)
    {
        cerr << a.st.st << " " << a.st.nd << " " << a.nd.st << " " << a.nd.nd << endl;
    }
}

void wypelnij2prawo()
{
    rep(j, m)
    {
        vector<pii> X(3e3, {-1, -1});
        for (int i = n - 1; i >= 0; i--)
            for (int a : prawo[i][j])
            {
                X[a] = (X[a].st == i + 1) ? mp(i, X[a].nd + 1) : mp(i, 1);
                R[i][j].pb({a, X[a].nd}); //glebokosc i ile
            }
    }
}

void wypelnij2dol()
{
    rep(i, n)
    {
        vector<pii> X(3e3, {-1, -1});
        for (int j = m - 1; j >= 0; j--)
            for (int a : dol[i][j])
            {
                X[a] = (X[a].st == j + 1) ? mp(j, X[a].nd + 1) : mp(j, 1);
                D[i][j].pb({a, X[a].nd}); //glebokosc i ile
            }
    }
}

vector<vector<int>> wypelnij1(vector<int> &Q)
{
    vector<pii> X;
    rep(j, Q.size())
        X.pb({Q[j], j});
    vector<vector<int>> P(Q.size());
    sort(all(X));
    reverse(all(X));
    set<pii> S;
    int j = 0;
    while (j < Q.size())
    {
        int k = j;

        while (k + 1 < m && X[j].st == X[k + 1].st)
            k++;
        for (int l = j; l <= k; l++)
        {
            // cerr << X[l].nd << " " << X[l].st << endl;
            S.insert({X[l].nd, X[l].st});
        }
        for (int l = j; l <= k; l++)
        {
            auto r = S.find({X[l].nd, X[l].st});
            auto q = (r == S.begin()) ? r : next(r, -1);
            auto s = (next(r, 1) == S.end()) ? r : next(r, 1);

            //   cerr << q->st << " " << r->st << " " << s->st << endl;

            if (r->st - q->st - 1 > 0) //popraawic!!!!
            {
                P[q->st].pb(r->st - q->st - 1);
                //cerr << q->st << " ech1 " << r->st << endl;
            }

            if (s->st - r->st - 1 > 0 && s->nd != r->nd)
            {
                P[r->st].pb(s->st - r->st - 1);
                //cerr << s->st << " ech2 " << r->st << endl;
            }
        }
        j = k + 1;
    }
    return P;
}

void solve(int i, int j)
{

    for (auto A : D[i][j + 1])
        for (auto B : R[i + 1][j])
        {

            if (B.nd >= A.st && A.nd >= B.st)
            {
                //odp.pb(mp(mp(i + 1, j + 1), mp(i + A.st, j + B.st)));
                // cout << "tuutaj:" << i << " " << j << endl;
                ans++;
            }
        }
}

long long count_rectangles(vector<vector<int32_t>> A)
{
    n = A.size();
    m = A[0].size();
    rep(i, n) rep(j, m) tab[i][j] = A[i][j];
    rep(i, n)
    {
        auto X = wypelnij1(A[i]);
        rep(j, m)
            prawo[i][j] = X[j];
    }
    rep(j, m)
    {
        vector<int> Y;
        rep(i, n)
            Y.pb(tab[i][j]);
        auto X = wypelnij1(Y);
        rep(i, n)
            dol[i][j] = X[i];
    }
    wypelnij2prawo();
    wypelnij2dol();
    /* 
    cerr << "DOL" << endl;
    rep(i, n)
    {
        rep(j, m)
        {
            cerr << i << " " << j << "::  ";
            for (auto a : D[i][j])
                cerr << a.st << " " << a.nd << ", ";
            cerr << endl;
            // cout << a << "              /// ";
        }
        cerr << endl;
    }
    cerr << "PRAWO" << endl;
    rep(i, n)
    {
        rep(j, m)
        {
            cerr << i << " " << j << "::  ";
            for (auto a : R[i][j])
                cerr << a.st << " " << a.nd << ", ";
            // cout << a << "              /// ";
            cerr << endl;
        }
        cerr << endl;
    }
    */
    rep(i, n - 1) rep(j, m - 1) solve(i, j);
    return ans;
}
/*
main()
{
    _upgrade;
    string S;
    cin >> S;
    int a, b;
    cin >> a >> b;
    vector<vector<int>> X(a, vector<int>(b));
    rep(i, a) rep(j, b) cin >> X[i][j];
    cout << count_rectangles(X)
         << endl;
    // wypisz();
}
*/

Compilation message

rect.cpp: In function 'std::vector<std::vector<int> > wypelnij1(std::vector<int>&)':
rect.cpp:15:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i = 0; i < (n); ++i)
                                     ^
rect.cpp:72:5: note: in expansion of macro 'rep'
     rep(j, Q.size())
     ^~~
rect.cpp:79:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (j < Q.size())
            ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 589944 KB Output is correct
2 Correct 574 ms 590200 KB Output is correct
3 Correct 531 ms 590068 KB Output is correct
4 Correct 528 ms 590072 KB Output is correct
5 Correct 534 ms 590024 KB Output is correct
6 Correct 540 ms 590060 KB Output is correct
7 Correct 584 ms 589948 KB Output is correct
8 Correct 540 ms 589936 KB Output is correct
9 Correct 527 ms 589944 KB Output is correct
10 Correct 552 ms 589944 KB Output is correct
11 Correct 569 ms 590036 KB Output is correct
12 Correct 540 ms 590008 KB Output is correct
13 Correct 566 ms 589816 KB Output is correct
14 Correct 581 ms 589868 KB Output is correct
15 Correct 574 ms 589956 KB Output is correct
16 Correct 526 ms 589816 KB Output is correct
17 Correct 567 ms 589816 KB Output is correct
18 Correct 528 ms 589816 KB Output is correct
19 Correct 529 ms 590032 KB Output is correct
20 Correct 532 ms 589944 KB Output is correct
21 Correct 574 ms 589944 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 589944 KB Output is correct
2 Correct 574 ms 590200 KB Output is correct
3 Correct 531 ms 590068 KB Output is correct
4 Correct 528 ms 590072 KB Output is correct
5 Correct 534 ms 590024 KB Output is correct
6 Correct 540 ms 590060 KB Output is correct
7 Correct 584 ms 589948 KB Output is correct
8 Correct 540 ms 589936 KB Output is correct
9 Correct 527 ms 589944 KB Output is correct
10 Correct 552 ms 589944 KB Output is correct
11 Correct 569 ms 590036 KB Output is correct
12 Correct 540 ms 590008 KB Output is correct
13 Correct 566 ms 589816 KB Output is correct
14 Correct 581 ms 589868 KB Output is correct
15 Correct 574 ms 589956 KB Output is correct
16 Correct 526 ms 589816 KB Output is correct
17 Correct 544 ms 591076 KB Output is correct
18 Correct 542 ms 591032 KB Output is correct
19 Correct 541 ms 591076 KB Output is correct
20 Correct 582 ms 590416 KB Output is correct
21 Correct 658 ms 590840 KB Output is correct
22 Correct 587 ms 590684 KB Output is correct
23 Correct 540 ms 590716 KB Output is correct
24 Correct 537 ms 590364 KB Output is correct
25 Correct 567 ms 589816 KB Output is correct
26 Correct 528 ms 589816 KB Output is correct
27 Correct 529 ms 590032 KB Output is correct
28 Correct 532 ms 589944 KB Output is correct
29 Correct 574 ms 589944 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 589944 KB Output is correct
2 Correct 574 ms 590200 KB Output is correct
3 Correct 531 ms 590068 KB Output is correct
4 Correct 528 ms 590072 KB Output is correct
5 Correct 534 ms 590024 KB Output is correct
6 Correct 540 ms 590060 KB Output is correct
7 Correct 584 ms 589948 KB Output is correct
8 Correct 540 ms 589936 KB Output is correct
9 Correct 527 ms 589944 KB Output is correct
10 Correct 552 ms 589944 KB Output is correct
11 Correct 569 ms 590036 KB Output is correct
12 Correct 540 ms 590008 KB Output is correct
13 Correct 566 ms 589816 KB Output is correct
14 Correct 581 ms 589868 KB Output is correct
15 Correct 574 ms 589956 KB Output is correct
16 Correct 526 ms 589816 KB Output is correct
17 Correct 544 ms 591076 KB Output is correct
18 Correct 542 ms 591032 KB Output is correct
19 Correct 541 ms 591076 KB Output is correct
20 Correct 582 ms 590416 KB Output is correct
21 Correct 658 ms 590840 KB Output is correct
22 Correct 587 ms 590684 KB Output is correct
23 Correct 540 ms 590716 KB Output is correct
24 Correct 537 ms 590364 KB Output is correct
25 Correct 575 ms 596248 KB Output is correct
26 Correct 581 ms 596472 KB Output is correct
27 Correct 578 ms 596556 KB Output is correct
28 Correct 573 ms 592852 KB Output is correct
29 Correct 582 ms 593840 KB Output is correct
30 Correct 585 ms 594016 KB Output is correct
31 Correct 582 ms 593804 KB Output is correct
32 Correct 580 ms 593912 KB Output is correct
33 Correct 567 ms 589816 KB Output is correct
34 Correct 528 ms 589816 KB Output is correct
35 Correct 529 ms 590032 KB Output is correct
36 Correct 532 ms 589944 KB Output is correct
37 Correct 574 ms 589944 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 589944 KB Output is correct
2 Correct 574 ms 590200 KB Output is correct
3 Correct 531 ms 590068 KB Output is correct
4 Correct 528 ms 590072 KB Output is correct
5 Correct 534 ms 590024 KB Output is correct
6 Correct 540 ms 590060 KB Output is correct
7 Correct 584 ms 589948 KB Output is correct
8 Correct 540 ms 589936 KB Output is correct
9 Correct 527 ms 589944 KB Output is correct
10 Correct 552 ms 589944 KB Output is correct
11 Correct 569 ms 590036 KB Output is correct
12 Correct 540 ms 590008 KB Output is correct
13 Correct 566 ms 589816 KB Output is correct
14 Correct 581 ms 589868 KB Output is correct
15 Correct 574 ms 589956 KB Output is correct
16 Correct 526 ms 589816 KB Output is correct
17 Correct 544 ms 591076 KB Output is correct
18 Correct 542 ms 591032 KB Output is correct
19 Correct 541 ms 591076 KB Output is correct
20 Correct 582 ms 590416 KB Output is correct
21 Correct 658 ms 590840 KB Output is correct
22 Correct 587 ms 590684 KB Output is correct
23 Correct 540 ms 590716 KB Output is correct
24 Correct 537 ms 590364 KB Output is correct
25 Correct 575 ms 596248 KB Output is correct
26 Correct 581 ms 596472 KB Output is correct
27 Correct 578 ms 596556 KB Output is correct
28 Correct 573 ms 592852 KB Output is correct
29 Correct 582 ms 593840 KB Output is correct
30 Correct 585 ms 594016 KB Output is correct
31 Correct 582 ms 593804 KB Output is correct
32 Correct 580 ms 593912 KB Output is correct
33 Correct 978 ms 631988 KB Output is correct
34 Correct 910 ms 620876 KB Output is correct
35 Correct 914 ms 620600 KB Output is correct
36 Correct 927 ms 609436 KB Output is correct
37 Correct 1172 ms 662776 KB Output is correct
38 Correct 1324 ms 662796 KB Output is correct
39 Correct 1247 ms 663200 KB Output is correct
40 Correct 1137 ms 658488 KB Output is correct
41 Correct 970 ms 614872 KB Output is correct
42 Correct 1043 ms 619852 KB Output is correct
43 Correct 1275 ms 633700 KB Output is correct
44 Correct 1257 ms 635768 KB Output is correct
45 Correct 886 ms 614372 KB Output is correct
46 Correct 869 ms 612728 KB Output is correct
47 Correct 1220 ms 631876 KB Output is correct
48 Correct 1259 ms 633160 KB Output is correct
49 Correct 567 ms 589816 KB Output is correct
50 Correct 528 ms 589816 KB Output is correct
51 Correct 529 ms 590032 KB Output is correct
52 Correct 532 ms 589944 KB Output is correct
53 Correct 574 ms 589944 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 543 ms 590564 KB Output is correct
2 Correct 538 ms 590456 KB Output is correct
3 Correct 554 ms 589984 KB Output is correct
4 Correct 535 ms 589868 KB Output is correct
5 Correct 540 ms 590392 KB Output is correct
6 Correct 539 ms 590328 KB Output is correct
7 Correct 542 ms 590328 KB Output is correct
8 Correct 541 ms 590224 KB Output is correct
9 Correct 538 ms 590200 KB Output is correct
10 Correct 536 ms 590176 KB Output is correct
11 Correct 547 ms 590272 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 589784 KB Output is correct
2 Correct 3252 ms 717132 KB Output is correct
3 Execution timed out 5104 ms 760532 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 589944 KB Output is correct
2 Correct 574 ms 590200 KB Output is correct
3 Correct 531 ms 590068 KB Output is correct
4 Correct 528 ms 590072 KB Output is correct
5 Correct 534 ms 590024 KB Output is correct
6 Correct 540 ms 590060 KB Output is correct
7 Correct 584 ms 589948 KB Output is correct
8 Correct 540 ms 589936 KB Output is correct
9 Correct 527 ms 589944 KB Output is correct
10 Correct 552 ms 589944 KB Output is correct
11 Correct 569 ms 590036 KB Output is correct
12 Correct 540 ms 590008 KB Output is correct
13 Correct 566 ms 589816 KB Output is correct
14 Correct 581 ms 589868 KB Output is correct
15 Correct 574 ms 589956 KB Output is correct
16 Correct 526 ms 589816 KB Output is correct
17 Correct 544 ms 591076 KB Output is correct
18 Correct 542 ms 591032 KB Output is correct
19 Correct 541 ms 591076 KB Output is correct
20 Correct 582 ms 590416 KB Output is correct
21 Correct 658 ms 590840 KB Output is correct
22 Correct 587 ms 590684 KB Output is correct
23 Correct 540 ms 590716 KB Output is correct
24 Correct 537 ms 590364 KB Output is correct
25 Correct 575 ms 596248 KB Output is correct
26 Correct 581 ms 596472 KB Output is correct
27 Correct 578 ms 596556 KB Output is correct
28 Correct 573 ms 592852 KB Output is correct
29 Correct 582 ms 593840 KB Output is correct
30 Correct 585 ms 594016 KB Output is correct
31 Correct 582 ms 593804 KB Output is correct
32 Correct 580 ms 593912 KB Output is correct
33 Correct 978 ms 631988 KB Output is correct
34 Correct 910 ms 620876 KB Output is correct
35 Correct 914 ms 620600 KB Output is correct
36 Correct 927 ms 609436 KB Output is correct
37 Correct 1172 ms 662776 KB Output is correct
38 Correct 1324 ms 662796 KB Output is correct
39 Correct 1247 ms 663200 KB Output is correct
40 Correct 1137 ms 658488 KB Output is correct
41 Correct 970 ms 614872 KB Output is correct
42 Correct 1043 ms 619852 KB Output is correct
43 Correct 1275 ms 633700 KB Output is correct
44 Correct 1257 ms 635768 KB Output is correct
45 Correct 886 ms 614372 KB Output is correct
46 Correct 869 ms 612728 KB Output is correct
47 Correct 1220 ms 631876 KB Output is correct
48 Correct 1259 ms 633160 KB Output is correct
49 Correct 543 ms 590564 KB Output is correct
50 Correct 538 ms 590456 KB Output is correct
51 Correct 554 ms 589984 KB Output is correct
52 Correct 535 ms 589868 KB Output is correct
53 Correct 540 ms 590392 KB Output is correct
54 Correct 539 ms 590328 KB Output is correct
55 Correct 542 ms 590328 KB Output is correct
56 Correct 541 ms 590224 KB Output is correct
57 Correct 538 ms 590200 KB Output is correct
58 Correct 536 ms 590176 KB Output is correct
59 Correct 547 ms 590272 KB Output is correct
60 Correct 623 ms 589784 KB Output is correct
61 Correct 3252 ms 717132 KB Output is correct
62 Execution timed out 5104 ms 760532 KB Time limit exceeded
63 Halted 0 ms 0 KB -