oj.uz

Submission #297968

# Submission time Handle Problem Language Result Execution time Memory
297968 2020-09-12T08:45:48 Z muhammad_hokimiyon Seats (IOI18_seats) C++14
100 / 100
 3508 ms 150520 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1000007;

int h,w;
int t[4 * maxn];
int lz[4 * maxn];
int mn[4 * maxn];
vector < vector < int > > a;

int comb( int x1 , int x2 )
{
    if( mn[x1] == mn[x2] ){
        return t[x1] + t[x2];
    }
    if( mn[x1] < mn[x2] ){
        return t[x1];
    }
    return t[x2];
}

void push( int x )
{
    lz[x + x] += lz[x];
    lz[x + x + 1] += lz[x];
    mn[x + x] += lz[x];
    mn[x + x + 1] += lz[x];
    lz[x] = 0;
}

void build( int x , int l , int r )
{
    t[x] = r - l + 1;
    if( l == r )return;
    int m = (l + r) / 2;
    build( x + x , l , m );
    build( x + x + 1 , m + 1 , r );
}

void upd( int x , int l , int r , int tl , int tr , int val )
{
    if( tl > tr )return;
    if( tl == l && tr == r ){
        lz[x] += val;
        mn[x] += val;
        return;
    }
    int m = (l + r) / 2;
    push( x );
    upd( x + x , l , m , tl , min( tr , m ) , val );
    upd( x + x + 1 , m + 1 , r , max( tl , m + 1 ) , tr , val );
    t[x] = comb( x + x , x + x + 1 );
    mn[x] = min( mn[x + x] , mn[x + x + 1] );
}

void ok( int i , int j , int val )
{
    if( i > h || j > w )return;
    vector < int > g;
    g.push_back(a[i][j]);
    g.push_back(a[i - 1][j]);
    g.push_back(a[i][j - 1]);
    g.push_back(a[i - 1][j - 1]);
    sort( g.begin() , g.end() );
    if( a[i][j] < min( a[i - 1][j] , a[i][j - 1] ) ){
        upd( 1 , 1 , h * w , a[i][j] , min( a[i - 1][j] , a[i][j - 1] ) - 1 , val );
    }
    upd( 1 , 1 , h * w , g[2] , g[3] - 1 , val );
}

vector < int > r,c;

void give_initial_chart(int H, int W, vector<int> R, vector<int> C)
{
    h = H;
    w = W;
    r = R;
    c = C;
    build( 1 , 1 , h * w );
    a.resize(H + 10);
    for( int i = 0; i < H + 10; i++ ){
        a[i].resize(W + 10);
    }
    for( int i = 0; i < W + 10; i++ ){
        a[0][i] = a[h + 1][i] = h * w + 1;
    }
    for( int i = 0; i < H + 10; i++ ){
        a[i][0] = a[i][W + 1] = h * w + 1;
    }
    for( int i = 0; i < H * W; i++ ){
        a[R[i] + 1][C[i] + 1] = i + 1;
    }
    for( int i = 1; i <= H; i++ ){
        for( int j = 1; j <= W; j++ ){
            ok( i , j , 1 );
        }
    }
}

int swap_seats(int a1, int b)
{
    int x1 = r[a1] + 1;
    int y1 = c[a1] + 1;
    int x2 = r[b] + 1;
    int y2 = c[b] + 1;
    vector < pair < int , int > > g;
    for( int i = 0; i <= 1; i++ ){
        for( int j = 0; j <= 1; j++ ){
            g.push_back({ i + x1 , j + y1 });
            g.push_back({ i + x2 , j + y2 });
        }
    }
    sort( g.begin() , g.end() );
    g.erase( unique( g.begin() , g.end() ) , g.end() );
    for( auto x : g )ok( x.first , x.second , -1 );
    swap( a[r[a1] + 1][c[a1] + 1] , a[r[b] + 1][c[b] + 1] );
    swap( r[a1] , r[b] );
    swap( c[a1] , c[b] );
    for( auto x : g )ok( x.first , x.second , 1 );
    return t[1];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 24 ms 512 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 15 ms 512 KB Output is correct
5 Correct 15 ms 512 KB Output is correct
6 Correct 27 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 29 ms 512 KB Output is correct
9 Correct 28 ms 512 KB Output is correct
10 Correct 30 ms 512 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 24 ms 512 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 15 ms 512 KB Output is correct
5 Correct 15 ms 512 KB Output is correct
6 Correct 27 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 29 ms 512 KB Output is correct
9 Correct 28 ms 512 KB Output is correct
10 Correct 30 ms 512 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct
13 Correct 69 ms 1272 KB Output is correct
14 Correct 82 ms 1400 KB Output is correct
15 Correct 30 ms 1656 KB Output is correct
16 Correct 22 ms 2048 KB Output is correct
17 Correct 56 ms 1436 KB Output is correct
18 Correct 59 ms 1400 KB Output is correct
19 Correct 53 ms 1340 KB Output is correct
20 Correct 44 ms 1656 KB Output is correct
21 Correct 26 ms 1660 KB Output is correct
22 Correct 26 ms 2048 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2317 ms 68484 KB Output is correct
2 Correct 1129 ms 55996 KB Output is correct
3 Correct 1272 ms 57480 KB Output is correct
4 Correct 957 ms 57408 KB Output is correct
5 Correct 988 ms 57336 KB Output is correct
6 Correct 1307 ms 57272 KB Output is correct
7 Correct 1257 ms 57336 KB Output is correct
8 Correct 1145 ms 57592 KB Output is correct
9 Correct 1298 ms 57464 KB Output is correct
10 Correct 1082 ms 57396 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1280 KB Output is correct
2 Correct 167 ms 7288 KB Output is correct
3 Correct 1102 ms 68256 KB Output is correct
4 Correct 2278 ms 68484 KB Output is correct
5 Correct 930 ms 107648 KB Output is correct
6 Correct 1555 ms 150520 KB Output is correct
7 Correct 863 ms 81400 KB Output is correct
8 Correct 1459 ms 68868 KB Output is correct
9 Correct 1142 ms 69020 KB Output is correct
10 Correct 1048 ms 76292 KB Output is correct
11 Correct 903 ms 107440 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 2164 KB Output is correct
2 Correct 121 ms 2036 KB Output is correct
3 Correct 140 ms 2036 KB Output is correct
4 Correct 167 ms 2300 KB Output is correct
5 Correct 225 ms 3256 KB Output is correct
6 Correct 1068 ms 100728 KB Output is correct
7 Correct 1240 ms 96632 KB Output is correct
8 Correct 1316 ms 96752 KB Output is correct
9 Correct 1700 ms 96884 KB Output is correct
10 Correct 997 ms 96632 KB Output is correct
11 Correct 1070 ms 108664 KB Output is correct
12 Correct 803 ms 101492 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 24 ms 512 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 15 ms 512 KB Output is correct
5 Correct 15 ms 512 KB Output is correct
6 Correct 27 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 29 ms 512 KB Output is correct
9 Correct 28 ms 512 KB Output is correct
10 Correct 30 ms 512 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct
13 Correct 69 ms 1272 KB Output is correct
14 Correct 82 ms 1400 KB Output is correct
15 Correct 30 ms 1656 KB Output is correct
16 Correct 22 ms 2048 KB Output is correct
17 Correct 56 ms 1436 KB Output is correct
18 Correct 59 ms 1400 KB Output is correct
19 Correct 53 ms 1340 KB Output is correct
20 Correct 44 ms 1656 KB Output is correct
21 Correct 26 ms 1660 KB Output is correct
22 Correct 26 ms 2048 KB Output is correct
23 Correct 2317 ms 68484 KB Output is correct
24 Correct 1129 ms 55996 KB Output is correct
25 Correct 1272 ms 57480 KB Output is correct
26 Correct 957 ms 57408 KB Output is correct
27 Correct 988 ms 57336 KB Output is correct
28 Correct 1307 ms 57272 KB Output is correct
29 Correct 1257 ms 57336 KB Output is correct
30 Correct 1145 ms 57592 KB Output is correct
31 Correct 1298 ms 57464 KB Output is correct
32 Correct 1082 ms 57396 KB Output is correct
33 Correct 67 ms 1280 KB Output is correct
34 Correct 167 ms 7288 KB Output is correct
35 Correct 1102 ms 68256 KB Output is correct
36 Correct 2278 ms 68484 KB Output is correct
37 Correct 930 ms 107648 KB Output is correct
38 Correct 1555 ms 150520 KB Output is correct
39 Correct 863 ms 81400 KB Output is correct
40 Correct 1459 ms 68868 KB Output is correct
41 Correct 1142 ms 69020 KB Output is correct
42 Correct 1048 ms 76292 KB Output is correct
43 Correct 903 ms 107440 KB Output is correct
44 Correct 91 ms 2164 KB Output is correct
45 Correct 121 ms 2036 KB Output is correct
46 Correct 140 ms 2036 KB Output is correct
47 Correct 167 ms 2300 KB Output is correct
48 Correct 225 ms 3256 KB Output is correct
49 Correct 1068 ms 100728 KB Output is correct
50 Correct 1240 ms 96632 KB Output is correct
51 Correct 1316 ms 96752 KB Output is correct
52 Correct 1700 ms 96884 KB Output is correct
53 Correct 997 ms 96632 KB Output is correct
54 Correct 1070 ms 108664 KB Output is correct
55 Correct 803 ms 101492 KB Output is correct
56 Correct 164 ms 2036 KB Output is correct
57 Correct 337 ms 2040 KB Output is correct
58 Correct 538 ms 2932 KB Output is correct
59 Correct 2206 ms 69496 KB Output is correct
60 Correct 3508 ms 69380 KB Output is correct
61 Correct 1739 ms 69752 KB Output is correct
62 Correct 1415 ms 89080 KB Output is correct
63 Correct 2975 ms 82448 KB Output is correct
64 Correct 2017 ms 73476 KB Output is correct
65 Correct 1896 ms 69780 KB Output is correct
66 Correct 2156 ms 66168 KB Output is correct
67 Correct 1936 ms 77180 KB Output is correct
68 Correct 1428 ms 94072 KB Output is correct
69 Correct 2702 ms 108616 KB Output is correct