Submission #1321198

#TimeUsernameProblemLanguageResultExecution timeMemory
1321198Roumak77Feast (NOI19_feast)C++17
4 / 100
29 ms2772 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; void solve(){ ll n, k; cin >> n >> k; vector<ll> v(n); ll t = 9; ll temp1 = 0; ll temp2 = 0; for(ll i = 0; i < n; i++) { cin >> v[i]; if (v[i] > 0) { if (t == 9) { temp1 += v[i]; }else { temp2 += v[i]; } }else { t = v[i]; } } if (t == 9) { cout << temp1 << endl; }else { if (k == 1) { cout << max(temp1, max(temp2, temp1 + temp2 + t)) << endl; }else { cout << temp1 + temp2 << endl; } } } bool single = true; signed main(){ ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); ll t = 1; if(!single) 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...