제출 #1223787

#제출 시각아이디문제언어결과실행 시간메모리
1223787madamadam3자리 배치 (IOI18_seats)C++20
0 / 100
4091 ms24568 KiB
#include "seats.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; // struct Fenw { // int w, h; // vector<vi> bit; // Fenw(int W, int H) { // } // }; int h, w; vi rows, cols; void give_initial_chart(int H, int W, vi R, vi C) { h = H; w = W; rows = R; cols = C; } int swap_seats(int a, int b) { swap(rows[a], rows[b]); swap(cols[a], cols[b]); // for (int i = 0; i < w; i++) for (int k = 0; k < w; k++) if (cols[k] == i) cout << k << " "; int r1 = rows[0], r2 = rows[0]; int c1 = cols[0], c2 = cols[0]; int beautiful = 0; for (int i = 0; i < h*w; i += min(c2 - c1 + 1, r2 - r1 + 1)) { r1 = min(r1, rows[i]); r2 = max(r2, rows[i]); c1 = min(c1, cols[i]); c2 = max(c2, cols[i]); int tl_area = (r2 - r1 + 1) * (c2 - c1 + 1); if (tl_area == i+1) { beautiful++; } } return beautiful; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...