Submission #743213

#TimeUsernameProblemLanguageResultExecution timeMemory
743213vjudge1Lasers (NOI19_lasers)C++17
0 / 100
2 ms1236 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 N = 1e5+5 ; int n , m , cnt , ans ; int l , r ; int qs[N] ; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> l >> r ; for(int i=1;i<=r;i++){ int x , y ; cin >> x >> y ; int st = l - y + 1 , ed = y ; if(st <= ed){ qs[st]++ , qs[min(ed+1 , l+1)]-- ; } } for(int i=1;i<=l;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...