oj.uz

Submission #676820

# Submission time Handle Problem Language Result Execution time Memory
676820 2023-01-01T09:07:43 Z DwightKSchrute Event Hopping 2 (JOI21_event2) C++17
7 / 100
 75 ms 10316 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
void compress(vvi& a){
    vi s;
    for(vi v:a)
        s.pb(v[0]),s.pb(v[1]);
    sort(all(s));
    for(vi& v:a){
        v[0] = lower_bound(all(s),v[0])-s.begin();
        v[1] = lower_bound(all(s),v[1])-s.begin();
    }
}
void solve() {
    int n,k;
    cin >> n >> k;
    vvi a(n,vi(3));
    for(int i=0; i<n ;i++){
        cin >> a[i][0] >> a[i][1];
        a[i][1]--;
        a[i][2]=i;
    }
    compress(a);
    //sort(all(a));

    vi dp(n),suff_mx(n+1),to(n+1);
    for(int i=n-1; i>=0; i--){
        dp[i]=1;
        int l=a[i][0],r=a[i][1];
        int nxt = lower_bound(a.begin()+i,a.end(),(vi){r+1,-1,-1})-a.begin();
        if(nxt<n)
            dp[i] = max(dp[i],1+suff_mx[nxt]);
        to[i] = nxt;
        suff_mx[i] = max(dp[i],suff_mx[i+1]);
    }
    if(dp[0]<k)out(-1)
    vi ans;
    for(int i=0; i<n; )
        if(dp[i]>=k && k)
            ans.pb(i+1),k--,i=to[i];
        else
            i++;

    for(int x:ans)
        cout << x << "\n";
}

Compilation message

event2.cpp: In function 'void solve()':
event2.cpp:91:13: warning: unused variable 'l' [-Wunused-variable]
   91 |         int l=a[i][0],r=a[i][1];
      |             ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 55 ms 10236 KB Output is correct
5 Correct 64 ms 10220 KB Output is correct
6 Correct 51 ms 10228 KB Output is correct
7 Correct 54 ms 10112 KB Output is correct
8 Correct 55 ms 10316 KB Output is correct
9 Correct 68 ms 10232 KB Output is correct
10 Correct 54 ms 10232 KB Output is correct
11 Correct 52 ms 10108 KB Output is correct
12 Correct 54 ms 9640 KB Output is correct
13 Correct 52 ms 9636 KB Output is correct
14 Correct 61 ms 9608 KB Output is correct
15 Correct 55 ms 9584 KB Output is correct
16 Correct 50 ms 9080 KB Output is correct
17 Correct 51 ms 9016 KB Output is correct
18 Correct 53 ms 9036 KB Output is correct
19 Correct 57 ms 8896 KB Output is correct
20 Correct 56 ms 8884 KB Output is correct
21 Correct 61 ms 8884 KB Output is correct
22 Correct 58 ms 8844 KB Output is correct
23 Correct 58 ms 8908 KB Output is correct
24 Correct 62 ms 8884 KB Output is correct
25 Correct 75 ms 8896 KB Output is correct
26 Correct 72 ms 8900 KB Output is correct
27 Correct 67 ms 8908 KB Output is correct
28 Correct 48 ms 8848 KB Output is correct
29 Correct 47 ms 8856 KB Output is correct
30 Correct 51 ms 9028 KB Output is correct
31 Correct 54 ms 8848 KB Output is correct
32 Correct 59 ms 8892 KB Output is correct
33 Correct 67 ms 8880 KB Output is correct
34 Correct 62 ms 9400 KB Output is correct
35 Correct 50 ms 9212 KB Output is correct
36 Correct 51 ms 9008 KB Output is correct
37 Correct 49 ms 9600 KB Output is correct
38 Correct 58 ms 9608 KB Output is correct
39 Correct 55 ms 9604 KB Output is correct
40 Correct 50 ms 9520 KB Output is correct
41 Correct 49 ms 9464 KB Output is correct
42 Correct 60 ms 8920 KB Output is correct
43 Correct 60 ms 9588 KB Output is correct
44 Correct 62 ms 9520 KB Output is correct
45 Correct 59 ms 9520 KB Output is correct
46 Correct 63 ms 9520 KB Output is correct

Subtask #2
0 / 1.0

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

Subtask #3
0 / 31.0

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

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 55 ms 10236 KB Output is correct
5 Correct 64 ms 10220 KB Output is correct
6 Correct 51 ms 10228 KB Output is correct
7 Correct 54 ms 10112 KB Output is correct
8 Correct 55 ms 10316 KB Output is correct
9 Correct 68 ms 10232 KB Output is correct
10 Correct 54 ms 10232 KB Output is correct
11 Correct 52 ms 10108 KB Output is correct
12 Correct 54 ms 9640 KB Output is correct
13 Correct 52 ms 9636 KB Output is correct
14 Correct 61 ms 9608 KB Output is correct
15 Correct 55 ms 9584 KB Output is correct
16 Correct 50 ms 9080 KB Output is correct
17 Correct 51 ms 9016 KB Output is correct
18 Correct 53 ms 9036 KB Output is correct
19 Correct 57 ms 8896 KB Output is correct
20 Correct 56 ms 8884 KB Output is correct
21 Correct 61 ms 8884 KB Output is correct
22 Correct 58 ms 8844 KB Output is correct
23 Correct 58 ms 8908 KB Output is correct
24 Correct 62 ms 8884 KB Output is correct
25 Correct 75 ms 8896 KB Output is correct
26 Correct 72 ms 8900 KB Output is correct
27 Correct 67 ms 8908 KB Output is correct
28 Correct 48 ms 8848 KB Output is correct
29 Correct 47 ms 8856 KB Output is correct
30 Correct 51 ms 9028 KB Output is correct
31 Correct 54 ms 8848 KB Output is correct
32 Correct 59 ms 8892 KB Output is correct
33 Correct 67 ms 8880 KB Output is correct
34 Correct 62 ms 9400 KB Output is correct
35 Correct 50 ms 9212 KB Output is correct
36 Correct 51 ms 9008 KB Output is correct
37 Correct 49 ms 9600 KB Output is correct
38 Correct 58 ms 9608 KB Output is correct
39 Correct 55 ms 9604 KB Output is correct
40 Correct 50 ms 9520 KB Output is correct
41 Correct 49 ms 9464 KB Output is correct
42 Correct 60 ms 8920 KB Output is correct
43 Correct 60 ms 9588 KB Output is correct
44 Correct 62 ms 9520 KB Output is correct
45 Correct 59 ms 9520 KB Output is correct
46 Correct 63 ms 9520 KB Output is correct
47 Correct 0 ms 316 KB Output is correct
48 Correct 1 ms 324 KB Output is correct
49 Incorrect 0 ms 212 KB Output isn't correct
50 Halted 0 ms 0 KB -