Submission #1007939

#TimeUsernameProblemLanguageResultExecution timeMemory
1007939devariaotaLasers (NOI19_lasers)C++17
10 / 100
12 ms6748 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define pp pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define pll pair<ll,ll> #define pii pair<int,int> #define vl vector<ll> #define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const ll maxn = 5e5+7, modn1 = 1e9+7, modn2 = 998244353; using namespace std; // kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!! // Kalo emang soalnya susah, pindah soal dulu // Jangan sampe diem, pikirin sesuatu, pasti bisa!!! // Cobain semua approach, jangan ngestuck di satu pemikiran // Jangan overthinking, jangan panik, tenangin pikiranmu ll t,n,q; ll a[maxn], pref[maxn]; void solve () { cin>>n>>q; ll ans = 0; while (q--) { ll k; cin>>k; for (ll i=1; i<=k; i++) { cin>>a[i]; pref[i] = a[i] + pref[i-1]; } ll cnt = 0; for (ll i=k; i>=1; i--) { ll x = pref[i]; ll y = n - cnt - a[i] + 1; if (x >= y) { ans += (x-y+1); } cnt += a[i]; } } cout<<ans<<endl; } int main () { nikah t = 1; // cin>>t; while (t--) { solve(); // cout<<endl; } }
#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...