| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 239833 | mhy908 | Lasers (NOI19_lasers) | C++14 | 579 ms | 29304 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define eb emplace_back
#define F first
#define S second
using namespace std;
typedef long long LL;
int n, q;
int arr[500010], sum[500010], ans, tmp, pv=1;
map<int, int> m;
int main(){
    scanf("%d %d", &n, &q);
    m[n+1]=0;
    for(int i=1; i<=q; i++){
        int sz;
        scanf("%d", &sz);
        for(int j=1; j<=sz; j++){
            scanf("%d", &arr[j]);
            sum[j]=sum[j-1]+arr[j];
        }
        for(int j=1; j<=sz; j++){
            int e=sum[j], s=n-(sum[sz]-sum[j-1])+1;
            if(s<=e){
                m[s]++;
                m[e+1]--;
            }
        }
    }
    for(auto i:m){
        if(tmp)ans+=i.F-pv+1;
        tmp+=i.S;
        pv=i.F+1;
    }
    printf("%d", ans);
}
Compilation message (stderr)
| # | 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... | ||||
