Submission #1305339

#TimeUsernameProblemLanguageResultExecution timeMemory
1305339dbekarysInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
9 ms716 KiB
#include <bits/stdc++.h> #define int long long #define pll pair<int,int> #define endl '\n' using namespace std; const int MOD2=998244353; const int MOD1=1e9+7; const int N=3e5+7; const int LOG=20; const long long inf=8e18+7; signed main() { ios_base::sync_with_stdio(0), cin.tie(0); int n,m; cin>> n>>m; map<int,int>mp; int mx=inf,k=0,mn=0; while(m--){ int x; cin>> x; if(x>0){ mp[x]++; if(mp[x]==1) k++; } else { x=abs(x); if(mp[x]){ mp[x]--; if(mp[x]==0) k--; } } } for(int i=0;i<=n;i++){ if(mp[i]) mx=min(mx,mp[i]); mn=max(mn,mp[i]); } if(mx==inf){ mx=0; } cout<< max({0ll,k+mx-2,mn-1}); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...