Submission #1319900

#TimeUsernameProblemLanguageResultExecution timeMemory
1319900trainingdnnsLasers (NOI19_lasers)C++20
24 / 100
224 ms27456 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ll l,r; cin>>l>>r; vector<vector<ll>> rows(r); for(ll i=0; i<r; i++) { ll x; cin>>x; for(ll j=0; j<x;j++) { ll xi;cin>>xi; rows[i].push_back(xi); } } ll ma=0; for(int i=0; i<r; i++) { ma=max(ma, rows[i][0]); } rows[0][0]=ma; ll ans=0; if(l%2==0) ans=(rows[0][0]-floor(l/2))*2; else ans=rows[0][0]>floor(l/2) ? ((rows[0][0]-floor(l/2)-1)*2 + 1) : 0; ll zero=0; cout<<max(ans, zero); }
#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...