제출 #1296056

#제출 시각아이디문제언어결과실행 시간메모리
1296056chaitanyamehtaLasers (NOI19_lasers)C++20
24 / 100
217 ms27772 KiB
// https://static.oj.uz/problem/c014a9e7a8f56bc2f9f572b0bdc08fa0/statement/ddc244fdcd6f2b1a2747c6561b1319e7dff1edb43080c46bffcfc3e9c8b6bb86/statement_en.pdf #include<bits/stdc++.h> using namespace std; #define int long long signed main(){ int l , r; cin>> l >> r; vector<vector<int>> rows(r); int len = 0; for(int i = 0 ; i < r ;i++){ int t; cin>>t; int temp = 0; for(int j = 0 ; j < t; j++){ int u;cin>>u; rows[i].push_back(u); temp += u; } len = max(len , temp); } int x = min(l , len); if(l%2==0){ int h = l / 2; if(x <= h)cout<<0; else{ int diff = abs(x - h); cout<<diff*2; } } else{ int h = (l + 1) / 2; if(x < h){ cout<<0; } else{ int diff = abs(x - h); cout<<diff*2+1; } } }
#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...