oj.uz

Submission #789577

# Submission time Handle Problem Language Result Execution time Memory
789577 2023-07-21T14:09:29 Z alexander707070 Seats (IOI18_seats) C++14
100 / 100
 2342 ms 134164 KB 
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;

int n,m,x,y;
vector<int> st[MAXN];
pair<int,int> pos[MAXN];

pair<int,int> tree[4*MAXN];
int lazy[4*MAXN];

void psh(int v){
    tree[2*v].first+=lazy[v];
    lazy[2*v]+=lazy[v];

    tree[2*v+1].first+=lazy[v];
    lazy[2*v+1]+=lazy[v];

    lazy[v]=0;
}

pair<int,int> combine(pair<int,int> fr,pair<int,int> sc){
    if(fr.first<sc.first)return fr;
    if(fr.first>sc.first)return sc;
    return {fr.first,fr.second+sc.second};
}

void update(int v,int l,int r,int ll,int rr,int val){
    if(ll>rr)return;
    if(l==ll and r==rr){
        tree[v].first+=val;
        lazy[v]+=val;
    }else{
        psh(v);
        int tt=(l+r)/2;
        update(2*v,l,tt,ll,min(tt,rr),val);
        update(2*v+1,tt+1,r,max(tt+1,ll),rr,val);
        tree[v]=combine(tree[2*v],tree[2*v+1]);
    }
}

vector<int> w;

void updatesq(int x,int y,int val){
    w={st[x][y], st[x][y+1], st[x+1][y], st[x+1][y+1]};
    sort(w.begin(),w.end());

    update(1,1,n*m,w[0],w[1]-1,val);
    update(1,1,n*m,w[2],w[3]-1,val);
}

void give_initial_chart(int H, int W,vector<int> R,vector<int> C){
    n=H; m=W;
    for(int i=0;i<=n+1;i++){
        for(int f=0;f<=m+1;f++){
            st[i].push_back(n*m+1);
        }
    }

    for(int i=1;i<=n*m;i++){
        st[R[i-1]+1][C[i-1]+1]=i;
        pos[i-1]={R[i-1]+1,C[i-1]+1};
    }
    
    for(int i=1;i<=4*n*m;i++){
        tree[i].second=1;
    }

    for(int i=0;i<=n;i++){
        for(int f=0;f<=m;f++){
            updatesq(i,f,1);
        }
    }

}

int swap_seats(int a, int b){
    x=pos[a].first; y=pos[a].second;
    updatesq(x-1,y-1,-1); updatesq(x-1,y,-1);
    updatesq(x,y,-1); updatesq(x,y-1,-1);

    x=pos[b].first; y=pos[b].second;
    updatesq(x-1,y-1,-1); updatesq(x-1,y,-1);
    updatesq(x,y,-1); updatesq(x,y-1,-1);

    swap(st[pos[a].first][pos[a].second],st[pos[b].first][pos[b].second]);
    swap(pos[a],pos[b]);

    x=pos[a].first; y=pos[a].second;
    updatesq(x-1,y-1,1); updatesq(x-1,y,1);
    updatesq(x,y,1); updatesq(x,y-1,1);

    x=pos[b].first; y=pos[b].second;
    updatesq(x-1,y-1,1); updatesq(x-1,y,1);
    updatesq(x,y,1); updatesq(x,y-1,1);

    return tree[1].second;
}

/*
int main(){
    //give_initial_chart(1,6,{0,0,0,0,0,0},{0,1,2,3,4,5});
    //cout<<swap_seats(0,2)<<"\n";
    //cout<<swap_seats(0,5)<<"\n";
    give_initial_chart(2, 3, {0, 1, 1, 0, 0, 1}, {0, 0, 1, 1, 2, 2});
    cout<<swap_seats(0,5)<<"\n";
    cout<<swap_seats(0,5)<<"\n";
}
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 26 ms 23940 KB Output is correct
3 Correct 35 ms 23924 KB Output is correct
4 Correct 25 ms 23920 KB Output is correct
5 Correct 25 ms 23892 KB Output is correct
6 Correct 30 ms 23916 KB Output is correct
7 Correct 33 ms 23892 KB Output is correct
8 Correct 30 ms 23924 KB Output is correct
9 Correct 31 ms 23948 KB Output is correct
10 Correct 33 ms 23932 KB Output is correct
11 Correct 32 ms 23944 KB Output is correct
12 Correct 28 ms 23932 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 26 ms 23940 KB Output is correct
3 Correct 35 ms 23924 KB Output is correct
4 Correct 25 ms 23920 KB Output is correct
5 Correct 25 ms 23892 KB Output is correct
6 Correct 30 ms 23916 KB Output is correct
7 Correct 33 ms 23892 KB Output is correct
8 Correct 30 ms 23924 KB Output is correct
9 Correct 31 ms 23948 KB Output is correct
10 Correct 33 ms 23932 KB Output is correct
11 Correct 32 ms 23944 KB Output is correct
12 Correct 28 ms 23932 KB Output is correct
13 Correct 71 ms 24660 KB Output is correct
14 Correct 73 ms 24736 KB Output is correct
15 Correct 46 ms 24888 KB Output is correct
16 Correct 36 ms 25004 KB Output is correct
17 Correct 54 ms 24788 KB Output is correct
18 Correct 53 ms 24740 KB Output is correct
19 Correct 54 ms 24780 KB Output is correct
20 Correct 44 ms 24848 KB Output is correct
21 Correct 37 ms 24892 KB Output is correct
22 Correct 37 ms 24916 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1460 ms 102268 KB Output is correct
2 Correct 781 ms 106720 KB Output is correct
3 Correct 732 ms 106828 KB Output is correct
4 Correct 630 ms 106708 KB Output is correct
5 Correct 674 ms 106828 KB Output is correct
6 Correct 629 ms 106748 KB Output is correct
7 Correct 674 ms 106820 KB Output is correct
8 Correct 744 ms 106732 KB Output is correct
9 Correct 772 ms 106848 KB Output is correct
10 Correct 717 ms 106760 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 24764 KB Output is correct
2 Correct 127 ms 31616 KB Output is correct
3 Correct 687 ms 106736 KB Output is correct
4 Correct 1468 ms 106836 KB Output is correct
5 Correct 606 ms 114720 KB Output is correct
6 Correct 1493 ms 134164 KB Output is correct
7 Correct 666 ms 109456 KB Output is correct
8 Correct 814 ms 107348 KB Output is correct
9 Correct 673 ms 108016 KB Output is correct
10 Correct 738 ms 110540 KB Output is correct
11 Correct 716 ms 118428 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 25416 KB Output is correct
2 Correct 90 ms 25416 KB Output is correct
3 Correct 139 ms 25444 KB Output is correct
4 Correct 212 ms 25552 KB Output is correct
5 Correct 278 ms 26420 KB Output is correct
6 Correct 1004 ms 115772 KB Output is correct
7 Correct 1171 ms 115664 KB Output is correct
8 Correct 965 ms 115684 KB Output is correct
9 Correct 1916 ms 115636 KB Output is correct
10 Correct 973 ms 115544 KB Output is correct
11 Correct 943 ms 115500 KB Output is correct
12 Correct 918 ms 115684 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23892 KB Output is correct
2 Correct 26 ms 23940 KB Output is correct
3 Correct 35 ms 23924 KB Output is correct
4 Correct 25 ms 23920 KB Output is correct
5 Correct 25 ms 23892 KB Output is correct
6 Correct 30 ms 23916 KB Output is correct
7 Correct 33 ms 23892 KB Output is correct
8 Correct 30 ms 23924 KB Output is correct
9 Correct 31 ms 23948 KB Output is correct
10 Correct 33 ms 23932 KB Output is correct
11 Correct 32 ms 23944 KB Output is correct
12 Correct 28 ms 23932 KB Output is correct
13 Correct 71 ms 24660 KB Output is correct
14 Correct 73 ms 24736 KB Output is correct
15 Correct 46 ms 24888 KB Output is correct
16 Correct 36 ms 25004 KB Output is correct
17 Correct 54 ms 24788 KB Output is correct
18 Correct 53 ms 24740 KB Output is correct
19 Correct 54 ms 24780 KB Output is correct
20 Correct 44 ms 24848 KB Output is correct
21 Correct 37 ms 24892 KB Output is correct
22 Correct 37 ms 24916 KB Output is correct
23 Correct 1460 ms 102268 KB Output is correct
24 Correct 781 ms 106720 KB Output is correct
25 Correct 732 ms 106828 KB Output is correct
26 Correct 630 ms 106708 KB Output is correct
27 Correct 674 ms 106828 KB Output is correct
28 Correct 629 ms 106748 KB Output is correct
29 Correct 674 ms 106820 KB Output is correct
30 Correct 744 ms 106732 KB Output is correct
31 Correct 772 ms 106848 KB Output is correct
32 Correct 717 ms 106760 KB Output is correct
33 Correct 62 ms 24764 KB Output is correct
34 Correct 127 ms 31616 KB Output is correct
35 Correct 687 ms 106736 KB Output is correct
36 Correct 1468 ms 106836 KB Output is correct
37 Correct 606 ms 114720 KB Output is correct
38 Correct 1493 ms 134164 KB Output is correct
39 Correct 666 ms 109456 KB Output is correct
40 Correct 814 ms 107348 KB Output is correct
41 Correct 673 ms 108016 KB Output is correct
42 Correct 738 ms 110540 KB Output is correct
43 Correct 716 ms 118428 KB Output is correct
44 Correct 53 ms 25416 KB Output is correct
45 Correct 90 ms 25416 KB Output is correct
46 Correct 139 ms 25444 KB Output is correct
47 Correct 212 ms 25552 KB Output is correct
48 Correct 278 ms 26420 KB Output is correct
49 Correct 1004 ms 115772 KB Output is correct
50 Correct 1171 ms 115664 KB Output is correct
51 Correct 965 ms 115684 KB Output is correct
52 Correct 1916 ms 115636 KB Output is correct
53 Correct 973 ms 115544 KB Output is correct
54 Correct 943 ms 115500 KB Output is correct
55 Correct 918 ms 115684 KB Output is correct
56 Correct 117 ms 25436 KB Output is correct
57 Correct 270 ms 25496 KB Output is correct
58 Correct 406 ms 26280 KB Output is correct
59 Correct 1325 ms 107804 KB Output is correct
60 Correct 2342 ms 107780 KB Output is correct
61 Correct 1233 ms 107780 KB Output is correct
62 Correct 1000 ms 111680 KB Output is correct
63 Correct 2231 ms 110412 KB Output is correct
64 Correct 1454 ms 108624 KB Output is correct
65 Correct 1212 ms 108264 KB Output is correct
66 Correct 1384 ms 108908 KB Output is correct
67 Correct 1447 ms 111456 KB Output is correct
68 Correct 1262 ms 119300 KB Output is correct
69 Correct 2145 ms 119388 KB Output is correct