oj.uz

답안 #631713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631713 2022-08-18T14:13:57 Z cadmiumsky Minerals (JOI19_minerals) C++14
75 / 100
 36 ms 3428 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()

using namespace std;

int getbit(int x, int shift) {
  if(shift < 0) return 1;
  return (x & (1 << shift)) > 0;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
//mt19937 rng(69);

int rnd(int x) { return rng() % x; }

namespace Q {
  int last = 0, curr = 0;
  bool isdiff() {return last != curr; }
  bool query(int x) { last = curr; curr = Query(x); return isdiff(); }
}
using namespace Q;
const int nmax = 43e3 + 5;
int lg[nmax];
void metasolve(vector<int> in, vector<int> out, vector<int> offset, vector<int> lim) {
  int N = in.size();
  for(int i = 0; i <= lg[N]; i++) {
    for(int j = 0; j < N; j++) {
      if(getbit(j, i) ^ getbit(j, i - 1))
	query(in[j]);
    }
    for(int j = 0; j < N; j++) {
      if(offset[j] + (1 << i) >= lim[j])
	continue;
      if(!query(out[j]))	
	offset[j] += (1 << i);
    }
  }
  for(int i = 0; i < offset.size(); i++) {
    Answer(in[offset[i]], out[i]);
  }
}

void Solve(int N) {
  lg[0] = -1;
  for(int i = 1; i <= N; i++)
    lg[i] = lg[i >> 1] + 1;
  vector<int> in, out;
  vector<int> offset, lim;
  vector<int> order(2 * N);
  iota(all(order), 1);
  random_shuffle(all(order), rnd);
  
  int last = 0, l = 0;
  for(auto x : order) {
    if(query(x))
      in.push_back(x);
    else {
      out.push_back(x);
      lim.push_back(in.size());
      offset.push_back(0);
      if(in.size() == out.size()) {
	metasolve(in, out, offset, lim);
	in.clear();
	out.clear();
	offset.clear();
	lim.clear();
      }
    }
  }
  //cerr << "\\";
  
  return;
}
#define count asdhshdjsdfhjdhjgdfjkhld

Compilation message

minerals.cpp: In function 'void metasolve(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
minerals.cpp:39:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for(int i = 0; i < offset.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:54:7: warning: unused variable 'last' [-Wunused-variable]
   54 |   int last = 0, l = 0;
      |       ^~~~
minerals.cpp:54:17: warning: unused variable 'l' [-Wunused-variable]
   54 |   int last = 0, l = 0;
      |                 ^

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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 10 ms 1360 KB Output is correct

Subtask #3
9.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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct

Subtask #4
30.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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct

Subtask #5
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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct
19 Correct 33 ms 3428 KB Output is correct
20 Correct 33 ms 3384 KB Output is correct
21 Correct 33 ms 3428 KB Output is correct
22 Correct 36 ms 3248 KB Output is correct

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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct
19 Correct 33 ms 3428 KB Output is correct
20 Correct 33 ms 3384 KB Output is correct
21 Correct 33 ms 3428 KB Output is correct
22 Correct 36 ms 3248 KB Output is correct
23 Incorrect 33 ms 3232 KB Wrong Answer [2]
24 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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct
19 Correct 33 ms 3428 KB Output is correct
20 Correct 33 ms 3384 KB Output is correct
21 Correct 33 ms 3428 KB Output is correct
22 Correct 36 ms 3248 KB Output is correct
23 Incorrect 33 ms 3232 KB Wrong Answer [2]
24 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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct
19 Correct 33 ms 3428 KB Output is correct
20 Correct 33 ms 3384 KB Output is correct
21 Correct 33 ms 3428 KB Output is correct
22 Correct 36 ms 3248 KB Output is correct
23 Incorrect 33 ms 3232 KB Wrong Answer [2]
24 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 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 7 ms 1104 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 11 ms 1404 KB Output is correct
15 Correct 33 ms 3408 KB Output is correct
16 Correct 36 ms 3400 KB Output is correct
17 Correct 36 ms 3380 KB Output is correct
18 Correct 33 ms 3216 KB Output is correct
19 Correct 33 ms 3428 KB Output is correct
20 Correct 33 ms 3384 KB Output is correct
21 Correct 33 ms 3428 KB Output is correct
22 Correct 36 ms 3248 KB Output is correct
23 Incorrect 33 ms 3232 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -