Submission #897548

#TimeUsernameProblemLanguageResultExecution timeMemory
897548bleahbleahSecurity Guard (JOI23_guard)C++17
12 / 100
10 ms1884 KiB
#include <bits/stdc++.h> #define all(x) (x).begin(),(x).end() using namespace std; using ll = long long; using ld = long double; //#define int ll #define sz(x) ((int)(x).size()) using pii = pair<int,int>; using tii = tuple<int,int,int>; vector<int> S; signed main() { cin.tie(0) -> sync_with_stdio(0); int n, m, q; cin >> n >> m >> q; S.resize(n); for(auto &x : S) cin >> x; ll sum = 0; for(int i = 0; i < n - 1; i++) sum += (S[i] == S[i + 1]) * S[i]; S.erase(unique(all(S)), end(S)); sum += 2 * (sz(S) - 1); for(int i = 0; i < sz(S) - 2; i++) { if(S[i] == S[i + 2] && S[i + 1] == 1) sum--; } cout << sum << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...