oj.uz

답안 #764243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764243 2023-06-23T09:25:43 Z Dan4Life Minerals (JOI19_minerals) C++17
6 / 100
 10 ms 464 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
int n;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

set<int> S;
void dnc(vector<int> l, vector<int> r, bool d){
    if(sz(l)<1) return;
    if(sz(l)==1) return void(Answer(l[0],r[0]));
    int mid = sz(l)/2, x, tot;
    vector<int> v[2],w[2]; 
    for(int i : {0,1}) v[i].clear(),w[i].clear(); 
    if(d==1){
      for(int i = 0; i < mid; i++) tot=Query(l[i]),S.insert(l[i]);
    }
    else{
      for(int i = mid; i<sz(l); i++) tot=Query(l[i]), S.erase(l[i]);
    }
    for(int i = 0; i < sz(l); i++) v[i>=mid].pb(l[i]);
    shuffle(all(r),rng);
    for(int i : r) x = Query(i), w[x==tot].pb(i), Query(i);
    dnc(v[0],w[0],0);
    for(auto u : S) Query(u);
    dnc(v[1],w[1],1);
}

void Solve(int N) {
    n = N;
    vector<int> v(2*n,0),w[2],z; int p=0;
    iota(all(v),1); shuffle(all(v),rng);
    for(int i = 0; i < sz(v); i++){
      int x = Query(v[i]);
      if(x!=p) w[0].pb(v[i]), z.pb(v[i]), p=x;
      else w[1].pb(v[i]),p=Query(v[i]);
    }
    dnc(w[0],w[1],1);
}

Compilation message

minerals.cpp: In function 'void dnc(std::vector<int>, std::vector<int>, bool)':
minerals.cpp:25:37: warning: 'tot' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |     for(int i : r) x = Query(i), w[x==tot].pb(i), Query(i);
      |                                    ~^~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 336 KB Output is correct
2 Incorrect 10 ms 464 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Incorrect 10 ms 464 KB Wrong Answer [2]
7 Halted 0 ms 0 KB -