oj.uz

답안 #1019702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019702 2024-07-11T07:52:48 Z tengiz05 Minerals (JOI19_minerals) C++17
40 / 100
 21 ms 2904 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
 
/*
 
read the solution a long time back, remember some key ideas from there (d&c, splitting with different ratio instead of 0.5)
 
*/
 
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){
    if(a.empty()) return;
    if(sz(a) == 1){
        ans.pb({a[0],b[0]});
        return;
    }
 
    vector<int> al,ar;
    rep(i,sz(a)){
        if(i < sz(a)/2){
            al.pb(a[i]);
        }
        else{
            ar.pb(a[i]);
        }
    }
 
    int distinct = 0;
    trav(x,al){
        distinct++;
        Query(x);
    }
 
    vector<int> bl,br;
 
    trav(x,b){
        int res = Query(x);
        if(res == distinct){
            bl.pb(x);
        }
        else{
            br.pb(x);
        }
        Query(x);
    }
 
    trav(x,al){
        Query(x);
    }
 
    go(al,bl);
    go(ar,br);
}
 
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);
    random_shuffle(v1.begin(), v1.end());
    random_shuffle(v2.begin(), v2.end());
    go(v1,v2);
 
    for(auto [i,j] : ans){
        Answer(i,j);
    }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Correct 11 ms 1368 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1284 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 11 ms 1368 KB Output is correct
14 Correct 11 ms 1368 KB Output is correct
15 Incorrect 21 ms 2904 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -