Submission #743048

#TimeUsernameProblemLanguageResultExecution timeMemory
743048vjudge1Lasers (NOI19_lasers)C++17
0 / 100
14 ms712 KiB

#include<bits/stdc++.h>

using namespace std;

using ll = long long ;
using pii = pair<ll , ll> ;
using i3 = tuple<ll , ll , ll> ;

const int MOD = 1e9+7 , N = 1e5+5 ;

int n , m , cnt , ans , qs[N] ;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m ;

    for(int i=1;i<=m;i++){
        int x ; cin >> x ;
        for(int j=1;j<=x;j++){
            int width ;
            cin >> width ;

            int now = n - width + 1 ;
            if(now <= width){
                qs[now]++ , qs[width+1]--;
            }
        }
    }
    for(int i=1;i<=1e5;i++){
        qs[i] += qs[i-1] ;

        if(qs[i] > 0) ans++;
    }

    cout << ans ;
}
#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...