oj.uz

답안 #297149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297149 2020-09-11T09:58:58 Z shayan_p 자리 배치 (IOI18_seats) C++17
100 / 100
 2769 ms 99556 KB 
#include<bits/stdc++.h>
#include "seats.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int inf = 1e9 + 10, maxn = 1e6 + 10;

int SM[maxn];

int SZ, now;
int mn[4 * maxn], lz[4 * maxn], cnt[4 * maxn];

void mrg(int id){
    mn[id] = min(mn[2*id], mn[2*id+1]);
    cnt[id] = 0;
    if(mn[id] == mn[2*id])
	cnt[id]+= cnt[2*id];
    if(mn[id] == mn[2*id+1])
	cnt[id]+= cnt[2*id+1];
}
void build(int l = 0, int r = SZ, int id = 1){
    if(r-l == 1){
	now+= SM[l];
	mn[id] = now;
	cnt[id] = 1;
	return;
    }
    int mid = (l+r) >> 1;
    build(l, mid, 2*id);
    build(mid, r, 2*id+1);
    mrg(id);
}
void shift(int l, int r, int id){
    mn[id]+= lz[id];
    if(r-l > 1)
	lz[2*id]+= lz[id], lz[2*id+1]+= lz[id];
    lz[id] = 0;
}
void add(int f, int s, int x, int l = 0, int r = SZ, int id = 1){
    shift(l, r, id);
    if(f >= s || l >= r || s <= l || r <= f)
	return;
    if(f <= l && r <= s){
	lz[id] = x;
	shift(l, r, id);
	return;
    }
    int mid = (l+r) >> 1;
    add(f, s, x, l, mid, 2*id);
    add(f, s, x, mid, r, 2*id+1);
    mrg(id);
}
int ASK(int pos, int l = 0, int r = SZ, int id = 1){
    shift(l, r, id);
    if(r-l == 1)
	return mn[id];
    int mid = (l+r) >> 1;
    if(pos < mid)
	return ASK(pos, l, mid, 2*id);
    else
	return ASK(pos, mid, r, 2*id+1);
}

vector<int> A, B;
vector< vector<int> > val;
int N, M;

int what(int x, int y){
    if(x < 0 || y < 0 || x >= N || y >= M)
	return inf;
    return val[x][y];
}
int what(pii p){
    return what(p.F, p.S);
}
void chng(int x, int y, int w){
    vector<pii> vec = { {x, y}, {x-1, y}, {x, y-1}, {x-1, y-1} };
    sort(vec.begin(), vec.end(), [](pii a, pii b){ return what(a) < what(b); });
    add(what(vec[0]), what(vec[1]), w);
    add(what(vec[2]), what(vec[3]), w);
}
void chng2(int x, int y){
    vector<pii> vec = { {x, y}, {x-1, y}, {x, y-1}, {x-1, y-1} };
    sort(vec.begin(), vec.end(), [](pii a, pii b){ return what(a) < what(b); });
    int l = what(vec[0]), r = what(vec[1]);
    l = min(l, SZ);
    r = min(r, SZ);
    if(l < r)
	SM[l]++, SM[r]--;
    l = what(vec[2]), r = what(vec[3]);
    l = min(l, SZ);
    r = min(r, SZ);
    if(l < r)
	SM[l]++, SM[r]--;
}

void all(int x, int y, int w){
    chng(x, y, w);
    chng(x+1, y, w);
    chng(x, y+1, w);
    chng(x+1, y+1, w);
}
void give_initial_chart(int N, int M, vector<int> A, vector<int> B){
    ::N = N, ::M = M, ::A = A, ::B = B;
    SZ = N * M;
    val.resize(N);
    for(int i = 0; i < N; i++)
	val[i].resize(M);
    for(int i = 0; i < N * M; i++)
	val[A[i]][B[i]] = i;
    for(int i = 0; i <= N; i++){
	for(int j = 0; j <= M; j++)
	    chng2(i, j);
    }
    build();
}
int swap_seats(int a, int b){
    pii pa = {A[a], B[a]}, pb = {A[b], B[b]};
    swap(A[a], A[b]);
    swap(B[a], B[b]);
    
    all(pa.F, pa.S, -1);
    val[pa.F][pa.S] = b;
    all(pa.F, pa.S, 1);

    all(pb.F, pb.S, -1);
    val[pb.F][pb.S] = a;
    all(pb.F, pb.S, 1);
    
    return mn[1] == 4 ? cnt[1] : 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 416 KB Output is correct
2 Correct 33 ms 512 KB Output is correct
3 Correct 45 ms 504 KB Output is correct
4 Correct 29 ms 512 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 44 ms 504 KB Output is correct
7 Correct 44 ms 464 KB Output is correct
8 Correct 39 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 47 ms 504 KB Output is correct
11 Correct 39 ms 504 KB Output is correct
12 Correct 28 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 416 KB Output is correct
2 Correct 33 ms 512 KB Output is correct
3 Correct 45 ms 504 KB Output is correct
4 Correct 29 ms 512 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 44 ms 504 KB Output is correct
7 Correct 44 ms 464 KB Output is correct
8 Correct 39 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 47 ms 504 KB Output is correct
11 Correct 39 ms 504 KB Output is correct
12 Correct 28 ms 504 KB Output is correct
13 Correct 92 ms 1144 KB Output is correct
14 Correct 107 ms 1144 KB Output is correct
15 Correct 64 ms 1144 KB Output is correct
16 Correct 49 ms 1652 KB Output is correct
17 Correct 77 ms 1124 KB Output is correct
18 Correct 79 ms 1144 KB Output is correct
19 Correct 72 ms 1152 KB Output is correct
20 Correct 62 ms 1280 KB Output is correct
21 Correct 51 ms 1144 KB Output is correct
22 Correct 58 ms 1656 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 854 ms 48632 KB Output is correct
2 Correct 649 ms 48632 KB Output is correct
3 Correct 648 ms 48764 KB Output is correct
4 Correct 637 ms 48632 KB Output is correct
5 Correct 628 ms 48628 KB Output is correct
6 Correct 634 ms 48680 KB Output is correct
7 Correct 635 ms 48560 KB Output is correct
8 Correct 654 ms 48756 KB Output is correct
9 Correct 646 ms 48664 KB Output is correct
10 Correct 656 ms 48740 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 1144 KB Output is correct
2 Correct 148 ms 5628 KB Output is correct
3 Correct 625 ms 48872 KB Output is correct
4 Correct 806 ms 48644 KB Output is correct
5 Correct 646 ms 48612 KB Output is correct
6 Correct 951 ms 99556 KB Output is correct
7 Correct 636 ms 48740 KB Output is correct
8 Correct 649 ms 48740 KB Output is correct
9 Correct 627 ms 49124 KB Output is correct
10 Correct 645 ms 51812 KB Output is correct
11 Correct 692 ms 72168 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 1524 KB Output is correct
2 Correct 181 ms 1396 KB Output is correct
3 Correct 267 ms 1568 KB Output is correct
4 Correct 341 ms 1524 KB Output is correct
5 Correct 535 ms 2196 KB Output is correct
6 Correct 1390 ms 49704 KB Output is correct
7 Correct 1392 ms 50020 KB Output is correct
8 Correct 1367 ms 50020 KB Output is correct
9 Correct 1776 ms 49892 KB Output is correct
10 Correct 1305 ms 61960 KB Output is correct
11 Correct 1269 ms 61796 KB Output is correct
12 Correct 1242 ms 61452 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 416 KB Output is correct
2 Correct 33 ms 512 KB Output is correct
3 Correct 45 ms 504 KB Output is correct
4 Correct 29 ms 512 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 44 ms 504 KB Output is correct
7 Correct 44 ms 464 KB Output is correct
8 Correct 39 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 47 ms 504 KB Output is correct
11 Correct 39 ms 504 KB Output is correct
12 Correct 28 ms 504 KB Output is correct
13 Correct 92 ms 1144 KB Output is correct
14 Correct 107 ms 1144 KB Output is correct
15 Correct 64 ms 1144 KB Output is correct
16 Correct 49 ms 1652 KB Output is correct
17 Correct 77 ms 1124 KB Output is correct
18 Correct 79 ms 1144 KB Output is correct
19 Correct 72 ms 1152 KB Output is correct
20 Correct 62 ms 1280 KB Output is correct
21 Correct 51 ms 1144 KB Output is correct
22 Correct 58 ms 1656 KB Output is correct
23 Correct 854 ms 48632 KB Output is correct
24 Correct 649 ms 48632 KB Output is correct
25 Correct 648 ms 48764 KB Output is correct
26 Correct 637 ms 48632 KB Output is correct
27 Correct 628 ms 48628 KB Output is correct
28 Correct 634 ms 48680 KB Output is correct
29 Correct 635 ms 48560 KB Output is correct
30 Correct 654 ms 48756 KB Output is correct
31 Correct 646 ms 48664 KB Output is correct
32 Correct 656 ms 48740 KB Output is correct
33 Correct 90 ms 1144 KB Output is correct
34 Correct 148 ms 5628 KB Output is correct
35 Correct 625 ms 48872 KB Output is correct
36 Correct 806 ms 48644 KB Output is correct
37 Correct 646 ms 48612 KB Output is correct
38 Correct 951 ms 99556 KB Output is correct
39 Correct 636 ms 48740 KB Output is correct
40 Correct 649 ms 48740 KB Output is correct
41 Correct 627 ms 49124 KB Output is correct
42 Correct 645 ms 51812 KB Output is correct
43 Correct 692 ms 72168 KB Output is correct
44 Correct 141 ms 1524 KB Output is correct
45 Correct 181 ms 1396 KB Output is correct
46 Correct 267 ms 1568 KB Output is correct
47 Correct 341 ms 1524 KB Output is correct
48 Correct 535 ms 2196 KB Output is correct
49 Correct 1390 ms 49704 KB Output is correct
50 Correct 1392 ms 50020 KB Output is correct
51 Correct 1367 ms 50020 KB Output is correct
52 Correct 1776 ms 49892 KB Output is correct
53 Correct 1305 ms 61960 KB Output is correct
54 Correct 1269 ms 61796 KB Output is correct
55 Correct 1242 ms 61452 KB Output is correct
56 Correct 215 ms 2132 KB Output is correct
57 Correct 440 ms 2036 KB Output is correct
58 Correct 740 ms 2808 KB Output is correct
59 Correct 1937 ms 62116 KB Output is correct
60 Correct 2769 ms 62028 KB Output is correct
61 Correct 1653 ms 61924 KB Output is correct
62 Correct 1488 ms 61668 KB Output is correct
63 Correct 2395 ms 61928 KB Output is correct
64 Correct 1837 ms 62056 KB Output is correct
65 Correct 1649 ms 61540 KB Output is correct
66 Correct 1974 ms 62088 KB Output is correct
67 Correct 1829 ms 64812 KB Output is correct
68 Correct 1521 ms 75752 KB Output is correct
69 Correct 2366 ms 84456 KB Output is correct