| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1275647 | lioow | Lasers (NOI19_lasers) | C++20 | 191 ms | 584 KiB |
#include <bits/stdc++.h>
#define repp(i,x,n) for(int i=x;i<=n;i++)
using namespace std;
#define int long long
const int MAXN = 3e5+5;
const int mod = 1e9+7;
signed main () {
int L,N;cin>>L>>N;
int maks=0;
repp(i,1,N){
int x;cin>>x;
int y;
repp(j,1,x){
cin>>y;
maks=max(maks,y);
}
}
cout<<max(0LL,maks*2-L)<<endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
