제출 #828309

#제출 시각아이디문제언어결과실행 시간메모리
828309vjudge1Lasers (NOI19_lasers)C++17
24 / 100
189 ms6044 KiB
#include<bits/stdc++.h> using namespace std; const int nmax = 5*1e5+5; int lenwall[nmax]; int main() { int L,R,X; int maxlen = 0; cin >> L >> R; for(int i=1; i<=R; i++) { cin >> X; for(int j=1; j<=X; j++) { cin >> lenwall[j]; maxlen = max(maxlen, lenwall[j]); } } int open = L-maxlen; if(2*open>=L) { cout << "0" << endl; } else { cout << L-(2*open) << endl; } return 0; }
#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...