제출 #116223

#제출 시각아이디문제언어결과실행 시간메모리
116223mirbek01자리 배치 (IOI18_seats)C++11
5 / 100
4097 ms56824 KiB
# include <bits/stdc++.h> # include "seats.h" using namespace std; const int N = 1e6 + 2; int t[4][N * 4], ans; vector <int> R, C; void upd(int pos, int v = 1, int tl = 1, int tr = R.size()){ if(tl == tr){ t[0][v] = R[tl - 1]; t[1][v] = C[tl - 1]; t[2][v] = R[tl - 1]; t[3][v] = C[tl - 1]; } else { int tm = (tl + tr) >> 1; if(pos <= tm) upd(pos, v << 1, tl, tm); else upd(pos, v << 1 | 1, tm + 1, tr); t[0][v] = max(t[0][v << 1], t[0][v << 1 | 1]); t[1][v] = max(t[1][v << 1], t[1][v << 1 | 1]); t[2][v] = min(t[2][v << 1], t[2][v << 1 | 1]); t[3][v] = min(t[3][v << 1], t[3][v << 1 | 1]); } } int get(int l, int r, int tp, int v = 1, int tl = 1, int tr = R.size()){ if(l > tr || tl > r){ if(tp <= 1) return 0; else return 1e9; } if(l <= tl && tr <= r) return t[tp][v]; int tm = (tl + tr) >> 1; if(tp <= 1) return max(get(l, r, tp, v << 1, tl, tm), get(l, r, tp, v << 1 | 1, tm + 1, tr)); else return min(get(l, r, tp, v << 1, tl, tm), get(l, r, tp, v << 1 | 1, tm + 1, tr)); } int check(int x){ int ret = (get(1, x, 0) - get(1, x, 2) + 1) * (get(1, x, 1) - get(1, x, 3) + 1); return ret; } void give_initial_chart(int H, int W, vector<int> r, vector<int> c) { R = r, C = c; for(int i = 0; i < R.size(); i ++){ upd(i + 1); } } int swap_seats(int a, int b) { if(a > b) swap(a, b); swap(R[a], R[b]); swap(C[a], C[b]); upd(a + 1); upd(b + 1); int ans = 1, cur = 1; while(cur < R.size()){ int ret = check(cur + 1); if(ret == cur + 1){ cur ++, ans ++; } else { cur = ret - 1; } } return ans; }

컴파일 시 표준 에러 (stderr) 메시지

seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:55:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < R.size(); i ++){
                      ~~^~~~~~~~~~
seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:72:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       while(cur < R.size()){
             ~~~~^~~~~~~~~~
#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...