Submission #1041291

#TimeUsernameProblemLanguageResultExecution timeMemory
1041291VMaksimoski008Restore Array (RMI19_restore)C++17
100 / 100
107 ms676 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; array<int, 3> E[m+2*n]; for(int i=0; i<m; i++) { int l, r, k, val; cin >> l >> r >> k >> val; l++; r++; if(!val) E[i] = { l - 1, r, r - l + 1 - k }; else E[i] = { r, l - 1, -(r - l + 1) + k - 1 }; } for(int i=1; i<=n; i++) E[m+i-1] = { i-1, i, 1 }; for(int i=1; i<=n; i++) E[m+n+i-1] = { i, i-1, 0 }; vector<int> dist(n+1, 1e9); dist[0] = 0; for(int i=1; i<=n; i++) for(auto &[u, v, w] : E) dist[v] = min(dist[v], dist[u] + w); for(auto &[u, v, w] : E) { if(dist[v] > dist[u] + w) { cout << -1 << '\n'; return 0; } } for(int i=1; i<=n; i++) cout << (dist[i] > dist[i-1]) << " "; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...