oj.uz

Submission #1092752

# Submission time Handle Problem Language Result Execution time Memory
1092752 2024-09-25T00:17:08 Z ByeWorld RMQ (NOI17_rmq) C++14
6.9 / 100
 2 ms 2664 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 1e5+15;
const int INF = 1e18+10;
const int MOD = 998244353;
const int LOG = 32;

int n, m;
vector <ipii> vec;
vector <int> add[MAXN];
int ret[MAXN], ri[MAXN], done[MAXN];
multiset <int> s;

void print(){
    return;
    cout << "ret\n";
    for(int p=1; p<=n; p++) cout << ret[p] << " \n"[p==n];
}
signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int l, r, mn; cin>>l>>r>>mn; l++; r++; mn++;
        vec.pb({mn, {l, r}});
    }
    for(int i=1; i<=n; i++) ret[i] = n;

    sort(vec.begin(), vec.end());

    for(int i=0; i<vec.size(); i++){
        int id = i;
        int mn = vec[i].se.se, mx = vec[i].se.fi;

        while(i+1<vec.size() && vec[i+1].fi==vec[id].fi){
            i++;
            mn = min(mn, vec[i].se.se);
            mx = max(mx, vec[i].se.fi);
        }

        if(mx <= mn){
            add[mx].pb(vec[id].fi);
            add[mn+1].pb(-vec[id].fi);
        } else {
            for(int j=1; j<=n; j++) cout << "-1 ";
            cout << '\n';
            exit(0);
        }
    }

    for(int i=1; i<=n; i++){
        for(auto in : add[i]){
            if(in < 0) s.erase(s.find(-in));
            else s.insert(in);
        }
        if(!s.empty()){
            ret[i] = *(--s.end());
            ri[*(--s.end())] = i;
            done[*(--s.end())] = 1;
        }
    } 
    print();

    for(int i=1; i<=n; i++){
        if(done[i]) continue;
        // cout << i << " i\n";
        for(int j=1; j<=n; j++){
            if(ret[j] == 0){
                ret[j] = i; ri[i] = j;
                break;
            }
            if(ret[j] > i) continue;
            int bef = ret[j];
            // cout << i << ' '<< j << " j\n";
            // cout << ret[j] << ' ' << ri[bef] << " pp\n";
            if(j == ri[bef]) continue;
            ret[j] = i; ri[i] = j;
            break;
        }
        print();
    }
    print();

    bool done = 1;
    for(int i=1; i<=n; i++)
        if(ret[i] == 0) done = 0;

    for(auto [val, ra] : vec){
        int l = ra.fi, r = ra.se;
        int mn = ret[l];
        for(int i=l+1; i<=r; i++) mn = min(mn, ret[i]);
        if(mn != val) done = 0;
    }

    if(!done){
        for(int i=1; i<=n; i++) cout << "-1 ";
        cout << '\n';
        exit(0);
    } else {
        for(int i=1; i<=n; i++) cout << ret[i]-1 << " \n"[i==n];
    }
}

Compilation message

rmq.cpp: In function 'int main()':
rmq.cpp:41:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i=0; i<vec.size(); i++){
      |                  ~^~~~~~~~~~~
rmq.cpp:45:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         while(i+1<vec.size() && vec[i+1].fi==vec[id].fi){
      |               ~~~^~~~~~~~~~~
rmq.cpp:98:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |     for(auto [val, ra] : vec){
      |              ^

Subtask #1
6.9 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Partially correct 1 ms 2664 KB Output is partially correct
3 Correct 1 ms 2664 KB Output is correct
4 Partially correct 1 ms 2656 KB Output is partially correct
5 Correct 1 ms 2664 KB Output is correct
6 Correct 1 ms 2664 KB Output is correct
7 Correct 1 ms 2664 KB Output is correct
8 Correct 1 ms 2664 KB Output is correct
9 Correct 1 ms 2664 KB Output is correct
10 Correct 1 ms 2664 KB Output is correct
11 Partially correct 1 ms 2664 KB Output is partially correct

Subtask #2
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Partially correct 1 ms 2664 KB Output is partially correct
3 Correct 1 ms 2664 KB Output is correct
4 Partially correct 1 ms 2656 KB Output is partially correct
5 Correct 1 ms 2664 KB Output is correct
6 Correct 1 ms 2664 KB Output is correct
7 Correct 1 ms 2664 KB Output is correct
8 Correct 1 ms 2664 KB Output is correct
9 Correct 1 ms 2664 KB Output is correct
10 Correct 1 ms 2664 KB Output is correct
11 Partially correct 1 ms 2664 KB Output is partially correct
12 Incorrect 2 ms 2664 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Partially correct 1 ms 2664 KB Output is partially correct
3 Correct 1 ms 2664 KB Output is correct
4 Partially correct 1 ms 2656 KB Output is partially correct
5 Correct 1 ms 2664 KB Output is correct
6 Correct 1 ms 2664 KB Output is correct
7 Correct 1 ms 2664 KB Output is correct
8 Correct 1 ms 2664 KB Output is correct
9 Correct 1 ms 2664 KB Output is correct
10 Correct 1 ms 2664 KB Output is correct
11 Partially correct 1 ms 2664 KB Output is partially correct
12 Incorrect 2 ms 2664 KB Output isn't correct
13 Halted 0 ms 0 KB -