oj.uz

답안 #116217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116217 2019-06-11T10:34:07 Z MvC 자리 배치 (IOI18_seats) C++14
100 / 100
 3843 ms 103800 KB 
//#pragma GCC optimize("O3")
#include "seats.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
int lazy[MAXN*4];
int h, w, dx[4] = {0, 0, -1, -1}, dy[4] = {0, -1, 0, -1};
vi arr[MAXN];
pii pos[MAXN],seg[4*MAXN];
 
int get(int i, int j) {
    if (0 > i || i >= h || 0 > j || j >= w)
        return h * w;
    return arr[i][j];
}
pair<int,int> merge(pair<int,int> x,pair<int,int> y)
{
	if(x.fr<y.fr)return x;
	if(x.fr>y.fr)return y;
	return make_pair(x.fr,x.sc+y.sc);
}
void build(int l, int r, int k) {
    lazy[k] = 0;
    if (l == r) {
        seg[k]=make_pair(0,1);
        return;
    }
    int m = (l + r) / 2;
    build(l, m, k * 2);
    build(m + 1, r, k*2+1);
    seg[k]=merge(seg[2*k],seg[2*k+1]);
}
void push(int nod,int l,int r)
{
    if(!lazy[nod])return;
    seg[nod].fr+=lazy[nod];
    if(l!=r)
    {
    	lazy[nod*2]+=lazy[nod];
		lazy[nod*2+1]+=lazy[nod];
	}
    lazy[nod]=0;
}
void upd(int l, int r, int k, int a, int b, int v) {
    if (b < l || r < a) return;
  	push(k,l,r);
    if (a <= l && r <= b) {
        lazy[k] += v;
      	push(k,l,r);
        return;
    }
    int m = (l + r) / 2;
    upd(l, m, k*2, a, b, v);
    upd(m+1, r, k*2+1, a, b, v);
    push(k*2,l,m);
  	push(k*2+1,m+1,r);
  	seg[k]=merge(seg[k*2],seg[k*2+1]);
}
pair<int,int> qry(int nod,int l,int r,int tl,int tr)
{
    push(nod,l,r);
    if(l>tr || r<tl)return make_pair(1e9,0);
    if(tl<=l && r<=tr)return seg[nod];
    int mid=(l+r)/2;
    return merge(qry(nod*2,l,mid,tl,tr),qry(nod*2+1,mid+1,r,tl,tr));
}
void calc(int x, int y, int v) {
    vi tmp = {0, 0, 0, 0};
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i], ny = y + dy[i];
        tmp[i] = get(nx, ny);
    }
    sort(tmp.begin(), tmp.end());
    if (tmp[0] != tmp[1])
        upd(0, h*w - 1, 1, tmp[0], tmp[1] - 1, v);
    if (tmp[2] != tmp[3])
        upd(0, h*w - 1, 1, tmp[2], tmp[3] - 1, v);
}
 
void give_initial_chart(int H, int W, vector<int> r, vector<int> c) {
    h = H, w = W;
    for (int i = 0; i < h; i++)
        arr[i].resize(w);
    for (int i = 0; i < h * w; i++) {
        arr[r[i]][c[i]] = i;
        pos[i] = {r[i], c[i]};
    }
    build(0, h*w - 1, 1);
    for (int i = 0; i <= h; i++)
        for (int j = 0; j <= w; j++)
            calc(i, j, 1);
}
 
int swap_seats(int a, int b) {
    int x1 = pos[a].fr, y1 = pos[a].sc;
    int x2 = pos[b].fr, y2 = pos[b].sc;
    for (int i = 0; i < 4; i++) {
        int nx = x1 - dx[i], ny = y1 - dy[i];
        calc(nx, ny, -1);
        nx = x2 - dx[i], ny = y2 - dy[i];
        calc(nx, ny, -1);
    }
    arr[x2][y2] = a;
    arr[x1][y1] = b;
    for (int i = 0; i < 4; i++) {
        int nx = x1 - dx[i], ny = y1 - dy[i];
        calc(nx, ny, 1);
        nx = x2 - dx[i], ny = y2 - dy[i];
        calc(nx, ny, 1);
    }
    swap(pos[a], pos[b]);
    return qry(1,0,h*w-1,0,h*w-1).sc;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 42 ms 23936 KB Output is correct
3 Correct 57 ms 24184 KB Output is correct
4 Correct 42 ms 23928 KB Output is correct
5 Correct 38 ms 23928 KB Output is correct
6 Correct 50 ms 23936 KB Output is correct
7 Correct 54 ms 23928 KB Output is correct
8 Correct 48 ms 23928 KB Output is correct
9 Correct 49 ms 23908 KB Output is correct
10 Correct 54 ms 23968 KB Output is correct
11 Correct 54 ms 23936 KB Output is correct
12 Correct 39 ms 23936 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 42 ms 23936 KB Output is correct
3 Correct 57 ms 24184 KB Output is correct
4 Correct 42 ms 23928 KB Output is correct
5 Correct 38 ms 23928 KB Output is correct
6 Correct 50 ms 23936 KB Output is correct
7 Correct 54 ms 23928 KB Output is correct
8 Correct 48 ms 23928 KB Output is correct
9 Correct 49 ms 23908 KB Output is correct
10 Correct 54 ms 23968 KB Output is correct
11 Correct 54 ms 23936 KB Output is correct
12 Correct 39 ms 23936 KB Output is correct
13 Correct 99 ms 24648 KB Output is correct
14 Correct 114 ms 24648 KB Output is correct
15 Correct 77 ms 24644 KB Output is correct
16 Correct 60 ms 24960 KB Output is correct
17 Correct 84 ms 24696 KB Output is correct
18 Correct 75 ms 24696 KB Output is correct
19 Correct 71 ms 24676 KB Output is correct
20 Correct 66 ms 24704 KB Output is correct
21 Correct 58 ms 24824 KB Output is correct
22 Correct 59 ms 24952 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2459 ms 75984 KB Output is correct
2 Correct 1217 ms 91896 KB Output is correct
3 Correct 1095 ms 91868 KB Output is correct
4 Correct 1072 ms 91012 KB Output is correct
5 Correct 1056 ms 91880 KB Output is correct
6 Correct 913 ms 91768 KB Output is correct
7 Correct 1073 ms 91888 KB Output is correct
8 Correct 1112 ms 91872 KB Output is correct
9 Correct 1128 ms 91896 KB Output is correct
10 Correct 1020 ms 91896 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 24576 KB Output is correct
2 Correct 194 ms 29944 KB Output is correct
3 Correct 967 ms 76596 KB Output is correct
4 Correct 2532 ms 76476 KB Output is correct
5 Correct 904 ms 76536 KB Output is correct
6 Correct 2370 ms 103800 KB Output is correct
7 Correct 961 ms 76536 KB Output is correct
8 Correct 1234 ms 76476 KB Output is correct
9 Correct 1052 ms 76536 KB Output is correct
10 Correct 1016 ms 77380 KB Output is correct
11 Correct 987 ms 88312 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 25048 KB Output is correct
2 Correct 153 ms 25388 KB Output is correct
3 Correct 207 ms 25204 KB Output is correct
4 Correct 256 ms 25332 KB Output is correct
5 Correct 440 ms 26044 KB Output is correct
6 Correct 1411 ms 76408 KB Output is correct
7 Correct 1761 ms 76408 KB Output is correct
8 Correct 1417 ms 76280 KB Output is correct
9 Correct 3293 ms 76380 KB Output is correct
10 Correct 1455 ms 76456 KB Output is correct
11 Correct 1303 ms 78792 KB Output is correct
12 Correct 1239 ms 78584 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 42 ms 23936 KB Output is correct
3 Correct 57 ms 24184 KB Output is correct
4 Correct 42 ms 23928 KB Output is correct
5 Correct 38 ms 23928 KB Output is correct
6 Correct 50 ms 23936 KB Output is correct
7 Correct 54 ms 23928 KB Output is correct
8 Correct 48 ms 23928 KB Output is correct
9 Correct 49 ms 23908 KB Output is correct
10 Correct 54 ms 23968 KB Output is correct
11 Correct 54 ms 23936 KB Output is correct
12 Correct 39 ms 23936 KB Output is correct
13 Correct 99 ms 24648 KB Output is correct
14 Correct 114 ms 24648 KB Output is correct
15 Correct 77 ms 24644 KB Output is correct
16 Correct 60 ms 24960 KB Output is correct
17 Correct 84 ms 24696 KB Output is correct
18 Correct 75 ms 24696 KB Output is correct
19 Correct 71 ms 24676 KB Output is correct
20 Correct 66 ms 24704 KB Output is correct
21 Correct 58 ms 24824 KB Output is correct
22 Correct 59 ms 24952 KB Output is correct
23 Correct 2459 ms 75984 KB Output is correct
24 Correct 1217 ms 91896 KB Output is correct
25 Correct 1095 ms 91868 KB Output is correct
26 Correct 1072 ms 91012 KB Output is correct
27 Correct 1056 ms 91880 KB Output is correct
28 Correct 913 ms 91768 KB Output is correct
29 Correct 1073 ms 91888 KB Output is correct
30 Correct 1112 ms 91872 KB Output is correct
31 Correct 1128 ms 91896 KB Output is correct
32 Correct 1020 ms 91896 KB Output is correct
33 Correct 96 ms 24576 KB Output is correct
34 Correct 194 ms 29944 KB Output is correct
35 Correct 967 ms 76596 KB Output is correct
36 Correct 2532 ms 76476 KB Output is correct
37 Correct 904 ms 76536 KB Output is correct
38 Correct 2370 ms 103800 KB Output is correct
39 Correct 961 ms 76536 KB Output is correct
40 Correct 1234 ms 76476 KB Output is correct
41 Correct 1052 ms 76536 KB Output is correct
42 Correct 1016 ms 77380 KB Output is correct
43 Correct 987 ms 88312 KB Output is correct
44 Correct 108 ms 25048 KB Output is correct
45 Correct 153 ms 25388 KB Output is correct
46 Correct 207 ms 25204 KB Output is correct
47 Correct 256 ms 25332 KB Output is correct
48 Correct 440 ms 26044 KB Output is correct
49 Correct 1411 ms 76408 KB Output is correct
50 Correct 1761 ms 76408 KB Output is correct
51 Correct 1417 ms 76280 KB Output is correct
52 Correct 3293 ms 76380 KB Output is correct
53 Correct 1455 ms 76456 KB Output is correct
54 Correct 1303 ms 78792 KB Output is correct
55 Correct 1239 ms 78584 KB Output is correct
56 Correct 176 ms 25580 KB Output is correct
57 Correct 372 ms 25716 KB Output is correct
58 Correct 537 ms 26460 KB Output is correct
59 Correct 1889 ms 82148 KB Output is correct
60 Correct 3822 ms 82040 KB Output is correct
61 Correct 1711 ms 82168 KB Output is correct
62 Correct 1361 ms 82168 KB Output is correct
63 Correct 3843 ms 81840 KB Output is correct
64 Correct 2184 ms 80760 KB Output is correct
65 Correct 1896 ms 81528 KB Output is correct
66 Correct 2120 ms 81784 KB Output is correct
67 Correct 2165 ms 82432 KB Output is correct
68 Correct 1636 ms 99592 KB Output is correct
69 Correct 3468 ms 93304 KB Output is correct