제출 #441676

#제출 시각아이디문제언어결과실행 시간메모리
441676MahfelToll (BOI17_toll)C++17
0 / 100
103 ms3088 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MXN = 5e4 + 20; ll a[MXN] , pref[MXN] , block[MXN]; int main() { ll k,n,m,o; cin >> k >> n >> m >> o; for(int i = 0 ; i < m ; i++) { int v,u,t; cin >> v >> u >> t; a[u] = t; } block[0] = 1; for(int i = 1 ; i < n ; i++) { pref[i] = (a[i] == 0 ? 0 : a[i]+pref[i-1]); block[i] = (a[i] == 0 ? block[i-1]+1 : block[i-1]); } while(o--) { int v,u; cin >> v >> u; if(block[v] != block[u] || u < v) { cout << "-1\n"; continue; } cout << pref[u]-(pref[v] == 0 ? 0 : pref[v-1]) << "\n"; } }
#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...