Submission #1086481

#TimeUsernameProblemLanguageResultExecution timeMemory
1086481minggaInfinite Race (EGOI24_infiniterace2)C++17
29 / 100
12 ms4828 KiB
#include "bits/stdc++.h" using namespace std; #define ln "\n" #define dbg(x) cout << #x << " = " << x << ln #define mp make_pair #define pb push_back #define fi first #define se second #define inf 2e18 #define fast_cin() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) #define out(file) freopen(file, "w", stdout) #define in(file) freopen(file, "r", stdin) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define int long long int MOD = 1e9 + 7; const int N = 2e5 + 7; int n, q; int x[N]; void sub1() { int cnt = 0; int cur = 0; while(q--) { int u; cin >> u; if(u < 0) { cur = 0; } else { if(cur == 1) cnt++; else cur = 1; } } cout << cnt; } void sub2() { vector<int> cnt(q+1, 0); for(int i = 1; i <= q; i++) { cnt[x[i]]++; } int ans = 0; for(int i = 1; i <= q; i++) { ans = max(ans, cnt[i] - 1); } cout << ans; } signed main() { fast_cin(); cin >> n >> q; if(n == 2) sub1(); else { bool ok = 1; for(int i = 1; i <= q; i++) { cin >> x[i]; if(x[i] < 0) ok = 0; } if(ok) sub2(); } cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...