| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1330707 | Jawad_Akbar_JJ | Seats (IOI18_seats) | C++20 | 957 ms | 24112 KiB |
#include <iostream>
#include <vector>
using namespace std;
vector<int> R, C;
int n, m;
void give_initial_chart(int r, int c, vector<int> x, vector<int> y){
n = r, m = c;
R = x, C = y;
}
int swap_seats(int a, int b){
swap(R[a], R[b]);
swap(C[a], C[b]);
int Ans = 0;
if (n * m <= 10000){
int x1 = 1e9, y1 = 1e9, x2 = 0, y2 = 0;
for (int i=0;i<n * m;i++){
x1 = min(x1, R[i]);
y1 = min(y1, C[i]);
x2 = max(x2, R[i]);
y2 = max(y2, C[i]);
if ((x2 - x1 + 1) * (y2 - y1 + 1) == i + 1)
Ans++;
}
}
return Ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
