# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
701699 | 2023-02-22T01:39:30 Z | chenyan | Preokret (COCI18_preokret) | C++17 | 1 ms | 340 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define ff first #define ss second #define all(x) x.begin(),x.end() #define pb emplace_back #define N 200010 vector<pii>v; int ans,cnt[N]; signed main(){ ios::sync_with_stdio(0); cin.tie(0); int n,m,i,j,k; cin>>n; for(i=0;i<n;i++){ cin>>j; cnt[j]++; if(j<=1440)ans++; } cin>>m; for(i=0;i<m;i++){ cin>>j; cnt[j]--; if(j<=1440)ans++; } int ans2=-1,res=0,now=0; for(i=1;i<=2880;i++){ now+=cnt[i]; if(res!=1&&now>0)ans2++,res=1; if(res!=-1&&now<0)ans2++,res=-1; } cout<<ans<<'\n'<<ans2<<'\n'; }
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 | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 0 ms | 340 KB | Output is correct |
6 | Correct | 0 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |