답안 #417166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417166 2021-06-03T12:31:22 Z AmineTrabelsi 자리 배치 (IOI18_seats) C++14
11 / 100
4000 ms 40772 KB
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> r,c;
int h,w,n;
int get(){
  int a = r[0],b=c[0],x= r[0],y=c[0];
  int ans = 1;
  for(int i=1;i<n;i++){
    int le = r[i], ri = c[i];
    if(le < a)a = le;
    else if(le > x)x = le;
    if(ri < b)b = ri;
    else if(ri > y)y = ri;
    ans += (x-a+1) * (y-b+1) == i+1;
    //i = max(i,(x-a+1) * (y-b+1)-2);
  }
  return ans;
}
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
  h = H,w= W,n = H*W;
  r = R;
  c = C;
}

int swap_seats(int a, int b) {
  swap(r[a],r[b]);
  swap(c[a],c[b]);
  return get();
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 432 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 432 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 142 ms 720 KB Output is correct
14 Correct 145 ms 720 KB Output is correct
15 Correct 145 ms 724 KB Output is correct
16 Correct 139 ms 732 KB Output is correct
17 Correct 140 ms 724 KB Output is correct
18 Correct 147 ms 716 KB Output is correct
19 Correct 139 ms 720 KB Output is correct
20 Correct 148 ms 708 KB Output is correct
21 Correct 135 ms 716 KB Output is correct
22 Correct 132 ms 720 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4062 ms 23728 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 544 KB Output is correct
2 Correct 1246 ms 3688 KB Output is correct
3 Execution timed out 4046 ms 39732 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1324 KB Output is correct
2 Correct 19 ms 1332 KB Output is correct
3 Correct 31 ms 1992 KB Output is correct
4 Correct 154 ms 1940 KB Output is correct
5 Correct 1379 ms 2264 KB Output is correct
6 Execution timed out 4096 ms 40772 KB Time limit exceeded
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 432 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 436 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 142 ms 720 KB Output is correct
14 Correct 145 ms 720 KB Output is correct
15 Correct 145 ms 724 KB Output is correct
16 Correct 139 ms 732 KB Output is correct
17 Correct 140 ms 724 KB Output is correct
18 Correct 147 ms 716 KB Output is correct
19 Correct 139 ms 720 KB Output is correct
20 Correct 148 ms 708 KB Output is correct
21 Correct 135 ms 716 KB Output is correct
22 Correct 132 ms 720 KB Output is correct
23 Execution timed out 4062 ms 23728 KB Time limit exceeded
24 Halted 0 ms 0 KB -