oj.uz

Submission #1092914

# Submission time Handle Problem Language Result Execution time Memory
1092914 2024-09-25T11:12:47 Z ByeWorld RMQ (NOI17_rmq) C++14
6.9 / 100
 2 ms 2656 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;
int ans[MAXN];
vector <ipii> vec;
vector <int> add[MAXN];
multiset <int> s;
bool aman = 1;

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}});
    }
    sort(vec.begin(), vec.end());
    for(auto [mn, ran] : vec){
        int l=ran.fi, r=ran.se;
        for(int j=l; j<=r; j++) ans[j] = max(ans[j], mn); 
    }
    // 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()) ans[i] = *(--s.end());

    // }

    for(int i=0; i<m; i++){
        int l=vec[i].se.fi, r=vec[i].se.se, mn = vec[i].fi;
        int val = ans[l];
        for(int j=l+1; j<=r; j++) val = min(val, ans[j]);
        if(val != mn) aman = 0;
    }
    if(!aman){
        for(int i=1; i<=n; i++) cout << "-1 ";
        cout << '\n';
    } else {
        for(int i=1; i<=n; i++) cout << ans[i]-1 << ' ';
        cout << '\n';
    }
}

Compilation message

rmq.cpp: In function 'int main()':
rmq.cpp:35:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |     for(auto [mn, ran] : vec){
      |              ^

Subtask #1
6.9 / 23.0

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

Subtask #2
0.0 / 44.0

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

Subtask #3
0.0 / 33.0

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