oj.uz

답안 #856977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856977 2023-10-05T03:02:37 Z nguyentunglam 자리 배치 (IOI18_seats) C++17
11 / 100
 4000 ms 41180 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
#define all(v) v.begin(), v.end()

using namespace std;

const int N = 1e6 + 10;

int r[N], c[N];
int h, w;

void give_initial_chart(int _h, int _w, vector<int> _r, vector<int> _c) {
//   for(int i = 0; i < _h * _w; i++) cout << _r[i] << " " << _c[i] << endl;

   h = _h; w = _w;
   for(int i = 0; i < h * w; i++) r[i] = _r[i], c[i] = _c[i];

//   for(int i = 0; i < h * w; i++) cout << r[i] << " " << c[i] << endl;
}

int swap_seats(int a, int b) {
   swap(r[a], r[b]);
   swap(c[a], c[b]);

   int up = 1e9, down = 0, leftt = 1e9, rightt = 0, ans = 0;

   for(int i = 0; i < h * w; i++) {
//      cerr << i << endl;
      up = min(up, r[i]);
      down = max(down, r[i]);
      leftt = min(leftt, c[i]);
      rightt = max(rightt, c[i]);
//      cout << r[i] << " " << c[i] << endl;
//      cout << up << " " << down << " " << leftt << " " << rightt << " " << i << endl;
      if ((down - up + 1) * (rightt - leftt + 1) == i + 1) {
         ans++;
      }
   }

   return ans;
}

#ifdef ngu
int main() {
   freopen ("task.inp", "r", stdin);
   freopen ("task.out", "w", stdout);

   int _h, _w; cin >> _h >> _w;
   vector<int> _r(_h * _w), _c(_h * _w);
   for(int i = 0; i < _h; i++) for(int j = 0; j < _w; j++) {
      int x; cin >> x;
      _r[x] = i;
      _c[x] = j;
   }

   give_initial_chart(_h, _w, _r, _c);

   int q; cin >> q;

   while (q--) {
      int a, b; cin >> a >> b;
      cout << swap_seats(a, b) << endl;
   }
}
#endif // ngu

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 4 ms 2652 KB Output is correct
9 Correct 3 ms 2652 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 3 ms 2648 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 4 ms 2652 KB Output is correct
9 Correct 3 ms 2652 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 3 ms 2648 KB Output is correct
13 Correct 121 ms 2896 KB Output is correct
14 Correct 127 ms 2908 KB Output is correct
15 Correct 121 ms 2900 KB Output is correct
16 Correct 125 ms 2904 KB Output is correct
17 Correct 121 ms 2904 KB Output is correct
18 Correct 125 ms 2904 KB Output is correct
19 Correct 121 ms 2884 KB Output is correct
20 Correct 124 ms 3016 KB Output is correct
21 Correct 124 ms 2904 KB Output is correct
22 Correct 120 ms 2900 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 2712 KB Output is correct
2 Correct 1085 ms 7412 KB Output is correct
3 Execution timed out 4014 ms 39880 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3796 KB Output is correct
2 Correct 12 ms 4052 KB Output is correct
3 Correct 27 ms 4160 KB Output is correct
4 Correct 136 ms 4232 KB Output is correct
5 Correct 1229 ms 4412 KB Output is correct
6 Execution timed out 4070 ms 41180 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 4 ms 2652 KB Output is correct
9 Correct 3 ms 2652 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 3 ms 2648 KB Output is correct
13 Correct 121 ms 2896 KB Output is correct
14 Correct 127 ms 2908 KB Output is correct
15 Correct 121 ms 2900 KB Output is correct
16 Correct 125 ms 2904 KB Output is correct
17 Correct 121 ms 2904 KB Output is correct
18 Correct 125 ms 2904 KB Output is correct
19 Correct 121 ms 2884 KB Output is correct
20 Correct 124 ms 3016 KB Output is correct
21 Correct 124 ms 2904 KB Output is correct
22 Correct 120 ms 2900 KB Output is correct
23 Execution timed out 4061 ms 23876 KB Time limit exceeded
24 Halted 0 ms 0 KB -