oj.uz

Submission #1043874

# Submission time Handle Problem Language Result Execution time Memory
1043874 2024-08-05T02:14:54 Z GrindMachine Minerals (JOI19_minerals) C++17
70 / 100
 24 ms 3196 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
some other solutions

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "minerals.h"

vector<pii> ans;

void go(vector<int> &a, vector<int> &b, ll t){
    if(a.empty()) return;
    if(sz(a) == 1){
        ans.pb({a[0],b[0]});
        return;
    }

    int mid1 = (ld)0.38*sz(a);
    amax(mid1,1);
    int mid2 = sz(a)-mid1;

    vector<int> al,ar;
    int d = 0;

    if(!t){
        rep(i,sz(a)){
            if(i < mid1){
                al.pb(a[i]);
                d = Query(a[i]);
            }
            else{
                ar.pb(a[i]);
            }
        }
    }
    else{
        rep(i,sz(a)){
            if(i < mid2){
                al.pb(a[i]);
            }
            else{
                ar.pb(a[i]);
                d = Query(a[i]);
            }
        }
    }

    vector<int> bl,br;

    trav(x,b){
        int res = Query(x);
        if(res == d){
            bl.pb(x);
        }
        else{
            br.pb(x);
        }
        d = res;
    }

    go(al,bl,1);
    go(ar,br,0);
}

void Solve(int n) {
    // int v = Query(1);
    // for (int i = 1; i <= N; ++i) {
    //     Answer(i, 2 * N + 1 - i);
    // }

    vector<int> v1,v2;
    int distinct = 0;

    rep1(i,2*n){
        int x = Query(i);
        if(x == distinct+1){
            v1.pb(i);
            distinct++;
        }
        else{
            v2.pb(i);
        }
    }

    rep1(i,2*n) Query(i);
    
    go(v1,v2,0);

    for(auto [i,j] : ans){
        Answer(i,j);
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 4 ms 1016 KB Output is correct
5 Correct 7 ms 1324 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct
19 Incorrect 24 ms 3160 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct
19 Incorrect 24 ms 3160 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct
19 Incorrect 24 ms 3160 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct
19 Incorrect 24 ms 3160 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 7 ms 1324 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 6 ms 1448 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 22 ms 3148 KB Output is correct
16 Correct 23 ms 3196 KB Output is correct
17 Correct 14 ms 3020 KB Output is correct
18 Correct 14 ms 3096 KB Output is correct
19 Incorrect 24 ms 3160 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -