| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 587473 | NekoRolly | RMQ (NOI17_rmq) | C++17 | 1087 ms | 2248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+4;
int n,q;
int a[N],p[N];
int L[N],R[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> q;
for (int i=0; i<n; i++) R[i] = n-1, p[i] = -1;
for (int i=0,l,r,x; i<q; i++){ cin >> l >> r >> x;
for (int j=l; j<=r; j++) a[j] = max(a[j], x);
L[x] = max(L[x], l), R[x] = min(R[x], r);
}
for (int i=0; i<n; i++){ int pos = -1;
for (int j=L[i]; j<=R[i]; j++) if (a[j] <= i && p[j] == -1) pos = j;
if (pos == -1){
for (int i=0; i<n; i++) p[i] = -1;
break;
}
p[pos] = i;
}
for (int i=0; i<n; i++) cout << p[i] << " "; cout << "\n";
return 0;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
