Submission #1236249

#TimeUsernameProblemLanguageResultExecution timeMemory
1236249elenatrifInfinite Race (EGOI24_infiniterace2)C++20
51 / 100
1096 ms1864 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int32_t main() { cin.tie(0); ios_base::sync_with_stdio(false); int n, q; cin >> n >> q; int query=0, cnt=0; vector<int> lugje(n+1,0); for(int i=0; i<q; i++){ cin >> query; if(query<0){ //nekoj ja prestiga lugje[abs(query)]=-1; //pred nea e } else{ //ona prestiga nekoj //treba da vidime u koi slucai ja pominuva lentata if(lugje[abs(query)]==1){ //covekot e, odnosno bil, pozadi nea i ima znak plus deka go preticala //znaci pominala finalnata linija //SE RESTARTIRAA CELATA NIZA NA LJUDI SVITE SA NA 0 PAK biten moment!!!! //pak e cuekot pozadi nea lugje.clear(); lugje.resize(n, 0); lugje[abs(query)]=1; cnt++; } else {//za -1 i 0 //cuekot e pred nea i ona sea go preticue //znaci ona e pred nego vo istiot krug ne nov, a cuekot e pozadi nea lugje[abs(query)]=1; //cnt ostanue isto } } } cout << cnt; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...