oj.uz

답안 #587027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587027 2022-07-01T08:19:10 Z PiejanVDC 자리 배치 (IOI18_seats) C++17
11 / 100
 4000 ms 44596 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>>v;
vector<pair<int,int>>loc;

int N,M;

void give_initial_chart(int n, int m, vector<int>r, vector<int>c) {
    N = n, M = m;
    v.resize(n);
    loc.resize(n*m);
    for(auto &z : v)
        z.resize(m);
    for(int i = 0 ; i < n*m ; i++)
        v[r[i]][c[i]] = i, loc[i] = {r[i], c[i]};
}

int swap_seats(int a, int b) {
    swap(v[loc[a].first][loc[a].second], v[loc[b].first][loc[b].second]);
    swap(loc[a], loc[b]);

    int sz = 0;

    int x1 = N, x2 = -1, y1 = M, y2 = -1;

    int ans = 0;

    while(sz < N*M) {

        //cout << sz << ' ' << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << '\n';

        x1 = min(x1, loc[sz].first), x2 = max(x2, loc[sz].first);
        y1 = min(y1, loc[sz].second), y2 = max(y2, loc[sz].second);

        ans += ((x2 - x1 + 1) * (y2 - y1 + 1) == sz+1 ? 1 : 0);
        sz++;
    }

    return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 424 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 4 ms 440 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 424 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 4 ms 440 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 145 ms 768 KB Output is correct
14 Correct 139 ms 772 KB Output is correct
15 Correct 150 ms 768 KB Output is correct
16 Correct 161 ms 1292 KB Output is correct
17 Correct 144 ms 768 KB Output is correct
18 Correct 137 ms 768 KB Output is correct
19 Correct 139 ms 800 KB Output is correct
20 Correct 155 ms 948 KB Output is correct
21 Correct 138 ms 772 KB Output is correct
22 Correct 139 ms 1292 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 780 KB Output is correct
2 Correct 1250 ms 4072 KB Output is correct
3 Execution timed out 4062 ms 43684 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 1956 KB Output is correct
2 Correct 20 ms 1992 KB Output is correct
3 Correct 40 ms 2012 KB Output is correct
4 Correct 153 ms 1916 KB Output is correct
5 Correct 1459 ms 2364 KB Output is correct
6 Execution timed out 4027 ms 44596 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 424 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 4 ms 440 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 145 ms 768 KB Output is correct
14 Correct 139 ms 772 KB Output is correct
15 Correct 150 ms 768 KB Output is correct
16 Correct 161 ms 1292 KB Output is correct
17 Correct 144 ms 768 KB Output is correct
18 Correct 137 ms 768 KB Output is correct
19 Correct 139 ms 800 KB Output is correct
20 Correct 155 ms 948 KB Output is correct
21 Correct 138 ms 772 KB Output is correct
22 Correct 139 ms 1292 KB Output is correct
23 Execution timed out 4097 ms 43692 KB Time limit exceeded
24 Halted 0 ms 0 KB -