#include using namespace std; typedef pair pii; int n, m; int board[100][100]; bool visited[100][100]; bool air[100][100]; int dy[4] = { -1, 0, 1, 0 }; int dx[4] = { 0, 1, 0, -1 }; int main() { int cnt = 0; int ans = 0; cin >> n >> m; for (int i = 0; i > board[i][j]; visited[i][j] = false; air[i][j] = true; if (board[i][j] == 1) cnt++; } } int hour ..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; pi_i arr[201]; bool cmp(pi_i a, pi_i b) { if (a.second == b.second) return a.first > n; for(int i = 0;i > arr[i].first >> arr[i].second; } sort(arr , arr ..
#include using namespace std; typedef long long ll; typedef pair pii; // board[y][x] = dt int board[10][10]; bool usedX[12][12]; bool usedY[12][12]; bool usedRec[5][5][12]; // emptys[idx] = {y , x}; vector emptys; bool able(int y , int x , int dt){ return ( usedX[y][dt] == false && usedY[x][dt] == false && usedRec[y / 3][x / 3][dt] == false ); } void doIt(int empIdx){ if(empIdx == emptys.size())..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int arr[201]; int arrTwo[201]; int m, s, c, ans; int main() { cin >> m >> s >> c; for (int i = 0; i > arr[i]; } sort(arr, arr + c); for (int i = 0; i < c - 1; i++) { arrTwo[i] = arr[i + 1] - arr[i]; } sort(arrTwo, arrTwo + c); for (int i = 0; i < ..
#include using namespace std; typedef long long ll; typedef pair pii; int n; stack st; int outs[500005]; int rasers[500005]; int main(){ cin >> n; for(int i = 1;i > rasers[i]; for(int i = n;i >= 1; i--) { int nowHei = rasers[i]; while(!st.empty() && st.top().first < nowHei) { outs[st.top().second] = i; st.pop(); } st.push({nowHei , i}); } while(!st.empty()){ outs[st.top().second] = 0; st.pop(); ..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int main(){ cin.tie(0); cout.tie(0); int n; cin >> n; vector vvi; for(int i = 0;i > g; vector vi; for(int j = 0;j > x; vi.push_back(x); } vvi.push_back(vi); } for(int i = 0;i > g; for(auto x : vvi[..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int main(){ cin.tie(0); cout.tie(0); char x[26]; for(int i = 0;i < 26;i++) x[i] = 'A' + i; for(auto j : x) cout
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; struct Student{ string name; int score; bool operator rhs.score; } }; int n; Student a[50005]; int main(){ cin.tie(0); cout.tie(0); cin >> n; fo..
#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; struct Rec{ int w , h; bool operator > a.w >> a.h >> b.w >> b.h; if(a < b) cout