oj.uz

Submission #875203

# Submission time Handle Problem Language Result Execution time Memory
875203 2023-11-18T19:06:42 Z abcvuitunggio Seats (IOI18_seats) C++17
100 / 100
 1773 ms 173144 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
struct T{
    pair <int, int> mn,sum;
    int cnt;
}st[4000001];
int n;
vector <int> r,c;
vector <vector <int>> a;
T operator +(T a, T b){
    T c;
    b.mn.first+=a.sum.first;
    b.mn.second+=a.sum.second;
    c.mn=min(a.mn,b.mn);
    c.cnt=0;
    if (c.mn==a.mn)
        c.cnt+=a.cnt;
    if (c.mn==b.mn)
        c.cnt+=b.cnt;
    c.sum={a.sum.first+b.sum.first,a.sum.second+b.sum.second};
    return c;
}
int cell(int i, int j){
    return (i<0||i>=a.size()||j<0||j>=a[0].size()?n:a[i][j]);
}
vector <int> best(int i, int j){
    vector <int> v;
    for (int k=0;k<2;k++)
        for (int l=0;l<2;l++)
            v.push_back(cell(i+k,j+l));
    sort(v.begin(),v.end());
    return v;
}
pair <int, int> calc(int i){
    int res=0,res2=0;
    for (int j=0;j<2;j++)
        for (int k=0;k<2;k++){
            auto v=best(r[i]-j,c[i]-k);
            res+=(i==v[0])-(i==v[1]);
            res2+=(i==v[2])-(i==v[3]);
        }
    return {res,res2};
}
void build(int node, int l, int r){
    if (l==r){
        st[node].mn=st[node].sum=calc(l);
        st[node].cnt=1;
        return;
    }
    int mid=(l+r)>>1;
    build(node<<1,l,mid);
    build(node<<1|1,mid+1,r);
    st[node]=st[node<<1]+st[node<<1|1];
}
void update(int node, int l, int r, int i){
    if (l>i||r<i||l>r)
        return;
    if (l==r){
        st[node].mn=st[node].sum=calc(i);
        st[node].cnt=1;
        return;
    }
    int mid=(l+r)>>1;
    update(node<<1,l,mid,i);
    update(node<<1|1,mid+1,r,i);
    st[node]=st[node<<1]+st[node<<1|1];
}
void give_initial_chart(int H, int W, vector <int> R, vector <int> C){
    r=R;
    c=C;
    n=H*W;
    a.resize(H);
    for (int i=0;i<H;i++)
        a[i].assign(W,0);
    for (int i=0;i<n;i++)
        a[r[i]][c[i]]=i;
    build(1,0,n-1);
}
int swap_seats(int x, int y){
    swap(r[x],r[y]);
    swap(c[x],c[y]);
    swap(a[r[x]][c[x]],a[r[y]][c[y]]);
    for (int i=-1;i<2;i++)
        for (int j=-1;j<2;j++){
            update(1,0,n-1,cell(r[x]+i,c[x]+j));
            update(1,0,n-1,cell(r[y]+i,c[y]+j));
        }
    return st[1].cnt;
}

Compilation message

seats.cpp: In function 'int cell(int, int)':
seats.cpp:25:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     return (i<0||i>=a.size()||j<0||j>=a[0].size()?n:a[i][j]);
      |                  ~^~~~~~~~~~
seats.cpp:25:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     return (i<0||i>=a.size()||j<0||j>=a[0].size()?n:a[i][j]);
      |                                    ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 78680 KB Output is correct
2 Correct 53 ms 78812 KB Output is correct
3 Correct 60 ms 78680 KB Output is correct
4 Correct 32 ms 78680 KB Output is correct
5 Correct 30 ms 78684 KB Output is correct
6 Correct 48 ms 78832 KB Output is correct
7 Correct 54 ms 78820 KB Output is correct
8 Correct 58 ms 78684 KB Output is correct
9 Correct 57 ms 78680 KB Output is correct
10 Correct 55 ms 78828 KB Output is correct
11 Correct 48 ms 78684 KB Output is correct
12 Correct 31 ms 78860 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 78680 KB Output is correct
2 Correct 53 ms 78812 KB Output is correct
3 Correct 60 ms 78680 KB Output is correct
4 Correct 32 ms 78680 KB Output is correct
5 Correct 30 ms 78684 KB Output is correct
6 Correct 48 ms 78832 KB Output is correct
7 Correct 54 ms 78820 KB Output is correct
8 Correct 58 ms 78684 KB Output is correct
9 Correct 57 ms 78680 KB Output is correct
10 Correct 55 ms 78828 KB Output is correct
11 Correct 48 ms 78684 KB Output is correct
12 Correct 31 ms 78860 KB Output is correct
13 Correct 85 ms 79196 KB Output is correct
14 Correct 88 ms 79196 KB Output is correct
15 Correct 41 ms 79196 KB Output is correct
16 Correct 41 ms 79708 KB Output is correct
17 Correct 64 ms 79196 KB Output is correct
18 Correct 81 ms 79196 KB Output is correct
19 Correct 78 ms 79044 KB Output is correct
20 Correct 64 ms 79412 KB Output is correct
21 Correct 41 ms 79192 KB Output is correct
22 Correct 40 ms 79704 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 106184 KB Output is correct
2 Correct 675 ms 121976 KB Output is correct
3 Correct 631 ms 122176 KB Output is correct
4 Correct 645 ms 122172 KB Output is correct
5 Correct 634 ms 122192 KB Output is correct
6 Correct 666 ms 122192 KB Output is correct
7 Correct 644 ms 122196 KB Output is correct
8 Correct 633 ms 122176 KB Output is correct
9 Correct 659 ms 122176 KB Output is correct
10 Correct 646 ms 122364 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 79008 KB Output is correct
2 Correct 140 ms 82512 KB Output is correct
3 Correct 674 ms 121936 KB Output is correct
4 Correct 721 ms 121940 KB Output is correct
5 Correct 581 ms 122188 KB Output is correct
6 Correct 908 ms 173144 KB Output is correct
7 Correct 644 ms 122196 KB Output is correct
8 Correct 674 ms 122196 KB Output is correct
9 Correct 639 ms 122448 KB Output is correct
10 Correct 679 ms 125012 KB Output is correct
11 Correct 643 ms 145620 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 79580 KB Output is correct
2 Correct 158 ms 79704 KB Output is correct
3 Correct 206 ms 79568 KB Output is correct
4 Correct 210 ms 79756 KB Output is correct
5 Correct 249 ms 79832 KB Output is correct
6 Correct 873 ms 106324 KB Output is correct
7 Correct 866 ms 106496 KB Output is correct
8 Correct 857 ms 106324 KB Output is correct
9 Correct 908 ms 106500 KB Output is correct
10 Correct 845 ms 106260 KB Output is correct
11 Correct 841 ms 106256 KB Output is correct
12 Correct 804 ms 106320 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 78680 KB Output is correct
2 Correct 53 ms 78812 KB Output is correct
3 Correct 60 ms 78680 KB Output is correct
4 Correct 32 ms 78680 KB Output is correct
5 Correct 30 ms 78684 KB Output is correct
6 Correct 48 ms 78832 KB Output is correct
7 Correct 54 ms 78820 KB Output is correct
8 Correct 58 ms 78684 KB Output is correct
9 Correct 57 ms 78680 KB Output is correct
10 Correct 55 ms 78828 KB Output is correct
11 Correct 48 ms 78684 KB Output is correct
12 Correct 31 ms 78860 KB Output is correct
13 Correct 85 ms 79196 KB Output is correct
14 Correct 88 ms 79196 KB Output is correct
15 Correct 41 ms 79196 KB Output is correct
16 Correct 41 ms 79708 KB Output is correct
17 Correct 64 ms 79196 KB Output is correct
18 Correct 81 ms 79196 KB Output is correct
19 Correct 78 ms 79044 KB Output is correct
20 Correct 64 ms 79412 KB Output is correct
21 Correct 41 ms 79192 KB Output is correct
22 Correct 40 ms 79704 KB Output is correct
23 Correct 720 ms 106184 KB Output is correct
24 Correct 675 ms 121976 KB Output is correct
25 Correct 631 ms 122176 KB Output is correct
26 Correct 645 ms 122172 KB Output is correct
27 Correct 634 ms 122192 KB Output is correct
28 Correct 666 ms 122192 KB Output is correct
29 Correct 644 ms 122196 KB Output is correct
30 Correct 633 ms 122176 KB Output is correct
31 Correct 659 ms 122176 KB Output is correct
32 Correct 646 ms 122364 KB Output is correct
33 Correct 83 ms 79008 KB Output is correct
34 Correct 140 ms 82512 KB Output is correct
35 Correct 674 ms 121936 KB Output is correct
36 Correct 721 ms 121940 KB Output is correct
37 Correct 581 ms 122188 KB Output is correct
38 Correct 908 ms 173144 KB Output is correct
39 Correct 644 ms 122196 KB Output is correct
40 Correct 674 ms 122196 KB Output is correct
41 Correct 639 ms 122448 KB Output is correct
42 Correct 679 ms 125012 KB Output is correct
43 Correct 643 ms 145620 KB Output is correct
44 Correct 122 ms 79580 KB Output is correct
45 Correct 158 ms 79704 KB Output is correct
46 Correct 206 ms 79568 KB Output is correct
47 Correct 210 ms 79756 KB Output is correct
48 Correct 249 ms 79832 KB Output is correct
49 Correct 873 ms 106324 KB Output is correct
50 Correct 866 ms 106496 KB Output is correct
51 Correct 857 ms 106324 KB Output is correct
52 Correct 908 ms 106500 KB Output is correct
53 Correct 845 ms 106260 KB Output is correct
54 Correct 841 ms 106256 KB Output is correct
55 Correct 804 ms 106320 KB Output is correct
56 Correct 285 ms 80320 KB Output is correct
57 Correct 486 ms 80908 KB Output is correct
58 Correct 675 ms 81100 KB Output is correct
59 Correct 1527 ms 123140 KB Output is correct
60 Correct 1773 ms 123140 KB Output is correct
61 Correct 1385 ms 123260 KB Output is correct
62 Correct 1081 ms 123100 KB Output is correct
63 Correct 1470 ms 123108 KB Output is correct
64 Correct 1462 ms 123140 KB Output is correct
65 Correct 1361 ms 123232 KB Output is correct
66 Correct 1487 ms 123492 KB Output is correct
67 Correct 1371 ms 126052 KB Output is correct
68 Correct 1206 ms 137552 KB Output is correct
69 Correct 1470 ms 146584 KB Output is correct