oj.uz

Submission #674514

# Submission time Handle Problem Language Result Execution time Memory
674514 2022-12-24T16:22:50 Z sugartheanh RMQ (NOI17_rmq) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
#define ll long long
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define ii pair<ll,ll>
#define iii pair<ll,ii>
#define fi first
#define se second
#define oo 1e18
#define bit(x,i) (((x)>>(i))&1)
using namespace std;
const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
int n,q,l,r,a,c[N],ans[N],L[N],R[N];
bool vs[N];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>q;
    fo(i,0,n-1)
        L[i] = 0,R[i] = n+1;
    while(q--)
    {
        cin>>l>>r>>a;
        fo(j,l,r)
            c[j] = max(c[j], a);
        L[a] = max(c[a], l);
        R[a] = min(c[a], r);
    }
    fo(i,0,n-1)
        vs[i] = 0,ans[i] = -1;
//    fo(i,0,n-1)
//        cout<<c[i]<<' ';
//    cout<<'\n';
    fo(i,0,n-1)
    {
        fo(j,0,n-1)
        {
            if(j >= c[i] && !vs[j] && L[j] <= i && i <= R[j])
            {
                ans[i] = j;
                vs[j] = 1;
                break;
            }
        }
    }
    fo(i,0,n-1)
    if(ans[i] == -1)
    {
        fo(j,1,n)
            cout<<-1<<' ';
        return 0;
    }
    fo(i,0,n-1)
        cout<<ans[i]<<' ';
}

Subtask #1
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -