Submission #897572

#TimeUsernameProblemLanguageResultExecution timeMemory
897572bleahbleahSecurity Guard (JOI23_guard)C++17
25 / 100
24 ms4192 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; //reverse(all(S)); 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)); n = sz(S); int mx = *max_element(all(S)); int revers = S[0] == mx; for(int i = 0; i < n - 1; i++) { if(revers == 0) { sum += S[i + 1]; if(S[i + 1] == mx) revers = 1; } else if(revers) { sum += S[i]; } } 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...