oj.uz

Submission #280515

# Submission time Handle Problem Language Result Execution time Memory
280515 2020-08-22T21:12:25 Z CaroLinda Rectangles (IOI19_rect) C++14
72 / 100
 4403 ms 1048580 KB 
#include <bits/stdc++.h>
#include "rect.h"

#define sz(x) (int)x.size()
#define mkt make_tuple
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define ff first
#define ss second
#define eb emplace_back
#define ll long long
#define mk make_pair
#define pii pair<int,int>
#define debug printf
#define all(x) x.begin(),x.end()

const int MAXN = 2510 ;

using namespace std ;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>

int N , M ;

void solve( vector< vector<int > > &grid, vector< vector< vector<pii> > > &toPut )
{

    int tamLinha = sz( grid[0] ) ;
    vector<int> esq(tamLinha) , dir(tamLinha) , getFreq( tamLinha ) , lastVisit(tamLinha) ;

    for(int i = 1 ; i < sz(grid) - 1 ; i++ )
    {

        for(int j = tamLinha - 1 ; j >= 0 ; j-- )
            esq[j] = dir[j] = -1 ;

        set<pii> s ;

        for(int j = tamLinha - 2;  j >= 0 ; j-- )
        {

            int x = j+1 ;

            while( x != -1 && grid[i][x]<= grid[i][j] )
                x = dir[x] ;

            dir[j] = x ;

        }

        for(int j = 1 ; j <  tamLinha ; j++ )
        {

            int x = j-1 ;

            while(x != -1 && grid[i][x] <= grid[i][j] )
                x = esq[x] ;

            esq[j] = x ;

        }

        lp(j,1,tamLinha-1)
            if( esq[j] != -1 && dir[j] != -1 && s.find(mk( esq[j] , dir[j] )) == s.end() )
            {
                toPut[ i ][ esq[j]+1 ].emplace_back( mk(dir[j]-1 , i) ) ;
                s.insert( mk(esq[j] , dir[j]) ) ;
            }

    }

   for(int j = 1 ; j < tamLinha ; j++ )
    {
        lp(i,0,tamLinha) getFreq[i] = lastVisit[i] = -1 ;

        for(int i = sz(grid) - 2 ; i >= 1 ; i-- )
            for(auto &e : toPut[i][j] )
            {
                if(  lastVisit[e.ff] != i+1 ) getFreq[e.ff] = i ;
                e.ss = getFreq[e.ff] ;
                lastVisit[e.ff] = i ;
            }
    }

}

ll count_rectangles( vector<vector<int> > mat )
{
    N = sz(mat) ;
    M = sz( mat[0] ) ;

    vector< vector<int> > gridCerto , gridRota ;
    vector< vector< vector<pii> > > auxCerto, auxRota ;
    lp(i,0,N)
    {
        gridCerto.emplace_back(*(new vector<int>)) ;
        auxCerto.emplace_back(*(new vector< vector<pii> >)) ;
        lp(j,0,M)
        {
            gridCerto[i].emplace_back( mat[i][j] ) ;
            auxCerto[i].emplace_back( *(new vector<pii>) ) ;
        }
    }
    lp(i,0,M)
    {
        gridRota.emplace_back( *(new vector<int>) ) ;
        auxRota.emplace_back(*(new vector< vector<pii> >)) ;
        lp(j,0,N)
        {
            gridRota[i].emplace_back( mat[j][i] ) ;
            auxRota[i].emplace_back( *(new vector<pii>) ) ;
        }
    }

    solve(gridCerto, auxCerto ) ;
    solve( gridRota, auxRota  );

   /* lp(i,1,N-1)
    {
        lp(j,1,M-1)
        {
            printf("Na casinha %d %d -> " , i , j ) ;
            for(auto e : auxCerto[i][j] ) printf("%d %d, " , e.ff, e.ss ) ;
            printf("\n") ;
        }
    } */

    ll ans = 0LL ;

    lp(i,1,N-1)
        lp(j,1,M-1)
        {
            sort( all(auxCerto[i][j]) ) ;
            sort( all(auxRota[j][i]) , [&](pii i, pii j) { return i.ss < j.ss ; }) ;

            ordered_set o_set ;

            lp(e,0, sz(auxRota[j][i]) ) o_set.insert( mk(auxRota[j][i][e].ff, e) ) ;

            int ptr = 0 ;

            for(auto e : auxCerto[i][j] )
            {
                while( ptr < sz( auxRota[j][i] ) && auxRota[j][i][ptr].ss < e.ff )
                {
                    auto it = o_set.find(mk(auxRota[j][i][ptr].ff, ptr) ) ;
                    if( it != o_set.end() ) o_set.erase( it ) ;
                    ptr++ ;
                }

                ans += (ll)( o_set.order_of_key( mk( e.ss+1, -1 ) ) ) ;

            }


        }

    return ans ;

}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 5 ms 1792 KB Output is correct
18 Correct 5 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 4 ms 1536 KB Output is correct
21 Correct 6 ms 1536 KB Output is correct
22 Correct 6 ms 1664 KB Output is correct
23 Correct 6 ms 1664 KB Output is correct
24 Correct 3 ms 1024 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 5 ms 1792 KB Output is correct
18 Correct 5 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 4 ms 1536 KB Output is correct
21 Correct 6 ms 1536 KB Output is correct
22 Correct 6 ms 1664 KB Output is correct
23 Correct 6 ms 1664 KB Output is correct
24 Correct 3 ms 1024 KB Output is correct
25 Correct 31 ms 8736 KB Output is correct
26 Correct 30 ms 8704 KB Output is correct
27 Correct 31 ms 8824 KB Output is correct
28 Correct 23 ms 7036 KB Output is correct
29 Correct 36 ms 7680 KB Output is correct
30 Correct 42 ms 7800 KB Output is correct
31 Correct 35 ms 7672 KB Output is correct
32 Correct 35 ms 7680 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 5 ms 1792 KB Output is correct
18 Correct 5 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 4 ms 1536 KB Output is correct
21 Correct 6 ms 1536 KB Output is correct
22 Correct 6 ms 1664 KB Output is correct
23 Correct 6 ms 1664 KB Output is correct
24 Correct 3 ms 1024 KB Output is correct
25 Correct 31 ms 8736 KB Output is correct
26 Correct 30 ms 8704 KB Output is correct
27 Correct 31 ms 8824 KB Output is correct
28 Correct 23 ms 7036 KB Output is correct
29 Correct 36 ms 7680 KB Output is correct
30 Correct 42 ms 7800 KB Output is correct
31 Correct 35 ms 7672 KB Output is correct
32 Correct 35 ms 7680 KB Output is correct
33 Correct 268 ms 87712 KB Output is correct
34 Correct 250 ms 82680 KB Output is correct
35 Correct 271 ms 83064 KB Output is correct
36 Correct 272 ms 77560 KB Output is correct
37 Correct 434 ms 102612 KB Output is correct
38 Correct 427 ms 102648 KB Output is correct
39 Correct 429 ms 103004 KB Output is correct
40 Correct 426 ms 97016 KB Output is correct
41 Correct 220 ms 78200 KB Output is correct
42 Correct 287 ms 80760 KB Output is correct
43 Correct 478 ms 88884 KB Output is correct
44 Correct 492 ms 90488 KB Output is correct
45 Correct 239 ms 46712 KB Output is correct
46 Correct 240 ms 46588 KB Output is correct
47 Correct 457 ms 88140 KB Output is correct
48 Correct 462 ms 88952 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 0 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2048 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct
3 Correct 9 ms 1792 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 10 ms 1920 KB Output is correct
6 Correct 10 ms 1920 KB Output is correct
7 Correct 10 ms 1920 KB Output is correct
8 Correct 10 ms 1920 KB Output is correct
9 Correct 10 ms 1920 KB Output is correct
10 Correct 7 ms 1000 KB Output is correct
11 Correct 8 ms 1408 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1497 ms 435496 KB Output is correct
3 Correct 3276 ms 921584 KB Output is correct
4 Correct 3286 ms 926140 KB Output is correct
5 Correct 3334 ms 926340 KB Output is correct
6 Correct 992 ms 418172 KB Output is correct
7 Correct 1821 ms 776756 KB Output is correct
8 Correct 1977 ms 826668 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 5 ms 1792 KB Output is correct
18 Correct 5 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 4 ms 1536 KB Output is correct
21 Correct 6 ms 1536 KB Output is correct
22 Correct 6 ms 1664 KB Output is correct
23 Correct 6 ms 1664 KB Output is correct
24 Correct 3 ms 1024 KB Output is correct
25 Correct 31 ms 8736 KB Output is correct
26 Correct 30 ms 8704 KB Output is correct
27 Correct 31 ms 8824 KB Output is correct
28 Correct 23 ms 7036 KB Output is correct
29 Correct 36 ms 7680 KB Output is correct
30 Correct 42 ms 7800 KB Output is correct
31 Correct 35 ms 7672 KB Output is correct
32 Correct 35 ms 7680 KB Output is correct
33 Correct 268 ms 87712 KB Output is correct
34 Correct 250 ms 82680 KB Output is correct
35 Correct 271 ms 83064 KB Output is correct
36 Correct 272 ms 77560 KB Output is correct
37 Correct 434 ms 102612 KB Output is correct
38 Correct 427 ms 102648 KB Output is correct
39 Correct 429 ms 103004 KB Output is correct
40 Correct 426 ms 97016 KB Output is correct
41 Correct 220 ms 78200 KB Output is correct
42 Correct 287 ms 80760 KB Output is correct
43 Correct 478 ms 88884 KB Output is correct
44 Correct 492 ms 90488 KB Output is correct
45 Correct 239 ms 46712 KB Output is correct
46 Correct 240 ms 46588 KB Output is correct
47 Correct 457 ms 88140 KB Output is correct
48 Correct 462 ms 88952 KB Output is correct
49 Correct 11 ms 2048 KB Output is correct
50 Correct 8 ms 1792 KB Output is correct
51 Correct 9 ms 1792 KB Output is correct
52 Correct 0 ms 256 KB Output is correct
53 Correct 10 ms 1920 KB Output is correct
54 Correct 10 ms 1920 KB Output is correct
55 Correct 10 ms 1920 KB Output is correct
56 Correct 10 ms 1920 KB Output is correct
57 Correct 10 ms 1920 KB Output is correct
58 Correct 7 ms 1000 KB Output is correct
59 Correct 8 ms 1408 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1497 ms 435496 KB Output is correct
62 Correct 3276 ms 921584 KB Output is correct
63 Correct 3286 ms 926140 KB Output is correct
64 Correct 3334 ms 926340 KB Output is correct
65 Correct 992 ms 418172 KB Output is correct
66 Correct 1821 ms 776756 KB Output is correct
67 Correct 1977 ms 826668 KB Output is correct
68 Correct 4403 ms 1042124 KB Output is correct
69 Correct 4034 ms 959096 KB Output is correct
70 Correct 4256 ms 959096 KB Output is correct
71 Correct 4202 ms 886648 KB Output is correct
72 Runtime error 3447 ms 1048580 KB Execution killed with signal 9
73 Halted 0 ms 0 KB -