Submission #1227093

#TimeUsernameProblemLanguageResultExecution timeMemory
1227093moonni10Infinite Race (EGOI24_infiniterace2)C++20
29 / 100
141 ms27032 KiB
#pragma GCC optimize("O3") #include<bits/stdc++.h> #define ll long long #define endl "\n" #define AI ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; vector<ll>a; vector<ll>b; vector<pair<ll,ll>>ans; void solve() { ll n,q,i,ma=0; cin>>n>>q; ll a[q]; for(i=0;i<q;i++) cin>>a[i]; map<ll,ll>mp; map<ll,ll>mm; for(i=0;i<q;i++) { if(a[i]<0) { a[i]=abs(a[i]); mm[a[i]]+=max(0LL,mp[a[i]]-1); mp[a[i]]=0; } else mp[a[i]]++; } for(i=1;i<n;i++) { // cout<<mm[i]<<mp[i]; mm[i]+=max(0LL,mp[i]-1); ma=max(ma,mm[i]); //cout<<mm[i]; } cout<<ma; } int main() { AI ll t=1; // cin>>t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...