oj.uz

답안 #875206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875206 2023-11-18T19:10:00 Z abcvuitunggio 자리 배치 (IOI18_seats) C++17
100 / 100
 1518 ms 103388 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
struct T{
    int mn,cnt,sum;
}st[4000001];
int n;
vector <int> r,c;
vector <vector <int>> a;
T operator +(T a, T b){
    T c;
    c.mn=min(a.mn,a.sum+b.mn);
    if (a.mn==a.sum+b.mn)
        c.cnt=a.cnt+b.cnt;
    else if (a.mn<a.sum+b.mn)
        c.cnt=a.cnt;
    else
        c.cnt=b.cnt;
    c.sum=a.sum+b.sum;
    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;
}
int calc(int i){
    int res=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])+(i==v[2])-(i==v[3]);
        }
    return res;
}
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:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     return (i<0||i>=a.size()||j<0||j>=a[0].size()?n:a[i][j]);
      |                  ~^~~~~~~~~~
seats.cpp:23:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     return (i<0||i>=a.size()||j<0||j>=a[0].size()?n:a[i][j]);
      |                                    ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 344 KB Output is correct
2 Correct 38 ms 500 KB Output is correct
3 Correct 45 ms 496 KB Output is correct
4 Correct 16 ms 348 KB Output is correct
5 Correct 15 ms 348 KB Output is correct
6 Correct 33 ms 508 KB Output is correct
7 Correct 43 ms 524 KB Output is correct
8 Correct 42 ms 512 KB Output is correct
9 Correct 41 ms 348 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 42 ms 348 KB Output is correct
12 Correct 16 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 344 KB Output is correct
2 Correct 38 ms 500 KB Output is correct
3 Correct 45 ms 496 KB Output is correct
4 Correct 16 ms 348 KB Output is correct
5 Correct 15 ms 348 KB Output is correct
6 Correct 33 ms 508 KB Output is correct
7 Correct 43 ms 524 KB Output is correct
8 Correct 42 ms 512 KB Output is correct
9 Correct 41 ms 348 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 42 ms 348 KB Output is correct
12 Correct 16 ms 348 KB Output is correct
13 Correct 61 ms 2908 KB Output is correct
14 Correct 62 ms 2952 KB Output is correct
15 Correct 27 ms 2908 KB Output is correct
16 Correct 24 ms 3420 KB Output is correct
17 Correct 45 ms 2908 KB Output is correct
18 Correct 56 ms 2964 KB Output is correct
19 Correct 54 ms 2908 KB Output is correct
20 Correct 43 ms 3208 KB Output is correct
21 Correct 24 ms 2968 KB Output is correct
22 Correct 24 ms 3416 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 718 ms 52708 KB Output is correct
2 Correct 660 ms 52700 KB Output is correct
3 Correct 650 ms 52640 KB Output is correct
4 Correct 620 ms 52800 KB Output is correct
5 Correct 601 ms 52708 KB Output is correct
6 Correct 636 ms 52720 KB Output is correct
7 Correct 611 ms 52916 KB Output is correct
8 Correct 697 ms 52816 KB Output is correct
9 Correct 634 ms 52568 KB Output is correct
10 Correct 627 ms 52564 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 2908 KB Output is correct
2 Correct 109 ms 7192 KB Output is correct
3 Correct 666 ms 52704 KB Output is correct
4 Correct 732 ms 52548 KB Output is correct
5 Correct 599 ms 52544 KB Output is correct
6 Correct 844 ms 103388 KB Output is correct
7 Correct 620 ms 52560 KB Output is correct
8 Correct 704 ms 52804 KB Output is correct
9 Correct 638 ms 52820 KB Output is correct
10 Correct 689 ms 55632 KB Output is correct
11 Correct 674 ms 76248 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 1432 KB Output is correct
2 Correct 139 ms 1520 KB Output is correct
3 Correct 162 ms 1308 KB Output is correct
4 Correct 181 ms 1488 KB Output is correct
5 Correct 189 ms 3788 KB Output is correct
6 Correct 803 ms 52816 KB Output is correct
7 Correct 812 ms 52816 KB Output is correct
8 Correct 802 ms 52800 KB Output is correct
9 Correct 826 ms 52800 KB Output is correct
10 Correct 788 ms 52804 KB Output is correct
11 Correct 758 ms 52940 KB Output is correct
12 Correct 724 ms 53164 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 344 KB Output is correct
2 Correct 38 ms 500 KB Output is correct
3 Correct 45 ms 496 KB Output is correct
4 Correct 16 ms 348 KB Output is correct
5 Correct 15 ms 348 KB Output is correct
6 Correct 33 ms 508 KB Output is correct
7 Correct 43 ms 524 KB Output is correct
8 Correct 42 ms 512 KB Output is correct
9 Correct 41 ms 348 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 42 ms 348 KB Output is correct
12 Correct 16 ms 348 KB Output is correct
13 Correct 61 ms 2908 KB Output is correct
14 Correct 62 ms 2952 KB Output is correct
15 Correct 27 ms 2908 KB Output is correct
16 Correct 24 ms 3420 KB Output is correct
17 Correct 45 ms 2908 KB Output is correct
18 Correct 56 ms 2964 KB Output is correct
19 Correct 54 ms 2908 KB Output is correct
20 Correct 43 ms 3208 KB Output is correct
21 Correct 24 ms 2968 KB Output is correct
22 Correct 24 ms 3416 KB Output is correct
23 Correct 718 ms 52708 KB Output is correct
24 Correct 660 ms 52700 KB Output is correct
25 Correct 650 ms 52640 KB Output is correct
26 Correct 620 ms 52800 KB Output is correct
27 Correct 601 ms 52708 KB Output is correct
28 Correct 636 ms 52720 KB Output is correct
29 Correct 611 ms 52916 KB Output is correct
30 Correct 697 ms 52816 KB Output is correct
31 Correct 634 ms 52568 KB Output is correct
32 Correct 627 ms 52564 KB Output is correct
33 Correct 63 ms 2908 KB Output is correct
34 Correct 109 ms 7192 KB Output is correct
35 Correct 666 ms 52704 KB Output is correct
36 Correct 732 ms 52548 KB Output is correct
37 Correct 599 ms 52544 KB Output is correct
38 Correct 844 ms 103388 KB Output is correct
39 Correct 620 ms 52560 KB Output is correct
40 Correct 704 ms 52804 KB Output is correct
41 Correct 638 ms 52820 KB Output is correct
42 Correct 689 ms 55632 KB Output is correct
43 Correct 674 ms 76248 KB Output is correct
44 Correct 114 ms 1432 KB Output is correct
45 Correct 139 ms 1520 KB Output is correct
46 Correct 162 ms 1308 KB Output is correct
47 Correct 181 ms 1488 KB Output is correct
48 Correct 189 ms 3788 KB Output is correct
49 Correct 803 ms 52816 KB Output is correct
50 Correct 812 ms 52816 KB Output is correct
51 Correct 802 ms 52800 KB Output is correct
52 Correct 826 ms 52800 KB Output is correct
53 Correct 788 ms 52804 KB Output is correct
54 Correct 758 ms 52940 KB Output is correct
55 Correct 724 ms 53164 KB Output is correct
56 Correct 280 ms 1736 KB Output is correct
57 Correct 439 ms 1272 KB Output is correct
58 Correct 595 ms 4028 KB Output is correct
59 Correct 1273 ms 53224 KB Output is correct
60 Correct 1518 ms 53064 KB Output is correct
61 Correct 1186 ms 53328 KB Output is correct
62 Correct 1077 ms 52952 KB Output is correct
63 Correct 1275 ms 53024 KB Output is correct
64 Correct 1220 ms 53072 KB Output is correct
65 Correct 1175 ms 52920 KB Output is correct
66 Correct 1387 ms 53312 KB Output is correct
67 Correct 1289 ms 56412 KB Output is correct
68 Correct 1083 ms 67136 KB Output is correct
69 Correct 1389 ms 76624 KB Output is correct