oj.uz

답안 #891259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891259 2023-12-22T15:41:45 Z vjudge1 자리 배치 (IOI18_seats) C++17
17 / 100
 4000 ms 56488 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;

struct AINT {
    int n;
    vi mi, ma;
    AINT(int N) : n(N), mi(4 * N), ma(4 * N) {} 
};

vi r, c;
vi mir, mic;
vi mar, mac;

int reg = 0;

void give_initial_chart(int H, int W, vi R, vi C) {
    r = mir = mar = R;
    c = mac = mic = C;
    reg = 1;
    for(int i = 1; i < H * W; ++i) {
        mar[i] = max(mar[i], mar[i - 1]);
        mac[i] = max(mac[i], mac[i - 1]);
        mir[i] = min(mir[i], mir[i - 1]);
        mic[i] = min(mic[i], mic[i - 1]);

        reg += (i + 1) == ((mac[i] - mic[i] + 1) * (mar[i] - mir[i] + 1));
    }
}

int swap_seats(int a, int b) {
    if(a > b) swap(a, b);
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    for(int i = a; i <= b; ++i)  {
        reg -= (i + 1) == ((mac[i] - mic[i] + 1) * (mar[i] - mir[i] + 1));
        mir[i] = mar[i] = r[i];
        mic[i] = mac[i] = c[i];
    }
    for(int i = a; i <= b; ++i)  {
        if(i) {
            mar[i] = max(mar[i], mar[i - 1]);
            mac[i] = max(mac[i], mac[i - 1]);
            mir[i] = min(mir[i], mir[i - 1]);
            mic[i] = min(mic[i], mic[i - 1]);
        }
        reg += (i + 1) == ((mac[i] - mic[i] + 1) * (mar[i] - mir[i] + 1));
    }
    return reg;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 448 KB Output is correct
11 Correct 3 ms 608 KB Output is correct
12 Correct 3 ms 604 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 448 KB Output is correct
11 Correct 3 ms 608 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 109 ms 860 KB Output is correct
14 Correct 109 ms 1028 KB Output is correct
15 Correct 109 ms 856 KB Output is correct
16 Correct 108 ms 1020 KB Output is correct
17 Correct 107 ms 860 KB Output is correct
18 Correct 108 ms 860 KB Output is correct
19 Correct 110 ms 1268 KB Output is correct
20 Correct 108 ms 1028 KB Output is correct
21 Correct 107 ms 1024 KB Output is correct
22 Correct 108 ms 1016 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4080 ms 55468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 1040 KB Output is correct
2 Correct 231 ms 5212 KB Output is correct
3 Correct 376 ms 55632 KB Output is correct
4 Correct 410 ms 55344 KB Output is correct
5 Correct 369 ms 55472 KB Output is correct
6 Correct 375 ms 55384 KB Output is correct
7 Correct 369 ms 55344 KB Output is correct
8 Correct 383 ms 55464 KB Output is correct
9 Correct 381 ms 55428 KB Output is correct
10 Correct 378 ms 55892 KB Output is correct
11 Correct 403 ms 55484 KB Output is correct

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2008 KB Output is correct
2 Correct 16 ms 2004 KB Output is correct
3 Correct 22 ms 2004 KB Output is correct
4 Correct 116 ms 2000 KB Output is correct
5 Correct 1091 ms 2768 KB Output is correct
6 Execution timed out 4035 ms 56488 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 448 KB Output is correct
11 Correct 3 ms 608 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 109 ms 860 KB Output is correct
14 Correct 109 ms 1028 KB Output is correct
15 Correct 109 ms 856 KB Output is correct
16 Correct 108 ms 1020 KB Output is correct
17 Correct 107 ms 860 KB Output is correct
18 Correct 108 ms 860 KB Output is correct
19 Correct 110 ms 1268 KB Output is correct
20 Correct 108 ms 1028 KB Output is correct
21 Correct 107 ms 1024 KB Output is correct
22 Correct 108 ms 1016 KB Output is correct
23 Execution timed out 4080 ms 55468 KB Time limit exceeded
24 Halted 0 ms 0 KB -