제출 #760861

#제출 시각아이디문제언어결과실행 시간메모리
760861Nonoze자리 배치 (IOI18_seats)C++17
11 / 100
4054 ms40760 KiB
#include "seats.h" #include <bits/stdc++.h> using namespace std; vector<int> r; vector<int> c; int h, w; int give_nb() { int comp=1; int c1=c[0], c2=c[0], r1=r[0], r2=r[0]; for (int i = 1; i < h*w; ++i) { c1=min(c1, c[i]); c2=max(c2, c[i]); r1=min(r1, r[i]); r2=max(r2, r[i]); if ((c2-c1+1)*(r2-r1+1)==i+1) { comp++; } } return comp; } void give_initial_chart(int H, int W, vector<int> R, vector<int> C) { r=R, c=C, h=H, w=W; } int swap_seats(int a, int b) { swap(c[a], c[b]); swap(r[a], r[b]); return give_nb(); }
#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...