# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
508357 | 2022-01-13T09:19:24 Z | ac2hu | Preokret (COCI18_preokret) | C++14 | 1 ms | 332 KB |
#include <bits/stdc++.h> using namespace std; signed main(){ iostream::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); vector<pair<int,int>> temp; int a;cin >> a; for(int i = 0;i<a;i++){ int t;cin >> t; temp.push_back({t,0}); } int b;cin >> b; for(int i = 0;i<b;i++){ int t;cin >> t; temp.push_back({t,1}); } int half = 1440; sort(temp.begin(),temp.end()); int c = 0; for(int i = 0;i<temp.size();i++){ if(temp[i].first <= half) c++; else break; } array<int,2> vec = {0,0}; int winner = temp[0].second; vec[temp[0].second]++; int tc = 0; for(int i = 1;i<temp.size();i++){ vec[temp[i].second]++; if(vec[0] > vec[1]){ if(winner != 0){ winner = 0; tc++; } } if(vec[1] > vec[0]){ if(winner != 1){ winner = 1; tc++; } } } cout << c << "\n" << tc << "\n"; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 308 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 332 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 0 ms | 312 KB | Output is correct |