# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
633956 | 2022-08-23T13:54:41 Z | Farhan_HY | Preokret (COCI18_preokret) | C++14 | 1 ms | 340 KB |
#include <bits/stdc++.h> #define int long long #define float double #define pb push_back #define F first #define S second #define T int t; cin >> t; while(t--) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; /// Benzema is the best player in the world const int N = 1e6 + 5; const int M = 1e3 + 3; const int inf = 8e18; const int LOG = 31; const int mod = 1e9 + 7; const float pi = atan(1) * 4; int n, m; vector<pair<int, int>> v; vector<bool> vv; main() { IOS cin >> n; int a = 0, b = 0; for(int i = 1; i <= n; i++) { int x; cin >> x; v.push_back({x, 1}); } cin >> m; for(int i = 1; i <= m; i++) { int x; cin >> x; v.push_back({x, 2}); } sort(begin(v), end(v)); int ans1 = 0, ans2 = 0; for(auto x: v) { if (x.S == 1) a++; else b++; if (x.F <= 1440) ans1 = a + b; if (a > b) vv.push_back(1); else if (a < b) vv.pb(0); else vv.pb(vv.back()); } for(int i = 1; i < vv.size(); i++) { ans2 += vv[i] != vv[i - 1]; } cout << ans1 << '\n' << ans2; } ///use scanf /* 3 10 1400 1500 2 7 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |