oj.uz

Submission #376748

# Submission time Handle Problem Language Result Execution time Memory
376748 2021-03-12T03:07:55 Z wiwiho Minerals (JOI19_minerals) C++14
40 / 100
 28 ms 2284 KB 
#include "minerals.h"

#include<bits/stdc++.h>

#define mp make_pair
#define F first
#define S second
#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}
#define eb emplace_back

using namespace std;

typedef long long ll;

using pll = pair<ll, ll>;

ostream& operator<<(ostream& o, pll p){
    return o << '(' << p.F << ',' << p.S << ')';
}

vector<int> t;
vector<int> ans;

void dothing(int l, int r){
    for(int i = l; i <= r; i++) Query(t[i]);
}

void check(int cnt, vector<int>& now, vector<int>& yes, vector<int>& no){
    for(int i : now){
        int r = Query(i);
        if(r == cnt) yes.eb(i);
        else no.eb(i);
        Query(i);
    }
}

void bs(int l, int r, vector<int>& now){
    if(l > r || now.empty()) return;
    //cerr << "bs " << l << " " << r << "  ";
    //printv(now, cerr);
    if(l == r){
        for(int i : now) ans[i] = t[l];
        return;
    }
    int m = (l + r) / 2;
    dothing(l, m);
    vector<int> yes, no;
    check(m - l + 1, now, yes, no);
    dothing(l, m);
    vector<int>().swap(now);
    bs(l, m, yes);
    bs(m + 1, r, no);
}

void Solve(int n){

    vector<int> now;
    ans.resize(2 * n + 1, -1);
    for(int i = 1; i <= 2 * n; i++){
        int r = Query(i);
        if(r != now.size() + 1){
            t.eb(i);
            Query(i);
        }
        else now.eb(i);
    }
    //printv(now, cerr);
    //printv(t, cerr);
    for(int i : now) Query(i);

    vector<int> tnow = now;
    bs(0, n - 1, tnow);
    //printv(ans, cerr);
    for(int i : now){
        Answer(i, ans[i]);
    }

}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:66:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         if(r != now.size() + 1){
      |            ~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 4 ms 492 KB Output is correct
4 Correct 7 ms 748 KB Output is correct
5 Correct 16 ms 1132 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 16 ms 1132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 12 ms 1260 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 28 ms 2284 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -