oj.uz

Submission #797486

# Submission time Handle Problem Language Result Execution time Memory
797486 2023-07-29T12:48:39 Z beaconmc Minerals (JOI19_minerals) C++14
90 / 100
 316 ms 16044 KB 
#include "minerals.h"
#include <bits/stdc++.h>
 
typedef long long ll;
 
 
 
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
 
 
 
std::set<ll> machine;
int query(int a){
  if (machine.count(a)){
    machine.erase(a);
  }else{
    machine.insert(a);
  }
  return Query(a);
}
 
void Solve(int N) {
  ll fuck = 0;
  using namespace std;
  vector<vector<ll>> top;
  vector<vector<ll>> bot;
   
  top.push_back({});
  bot.push_back({});
   
   
  ll cur = 0;
   
  FOR(i,1, 2*N+1){
   
    ll result = query(i);
    if (result == cur + 1){
      cur++;
      top[0].push_back(i);
    }else{
      bot[0].push_back(i);
    }
  }


   
  ll sus = 0;
   
  while (!(top.size() == bot.size() && bot.size() == N)){

    sus++;
   
    vector<vector<ll>> temp;
    for (auto&i : bot){
      if (i.size() == 1){
        temp.push_back(i);
        continue;
      }
      long double ratio = 2;
      if (i.size() >= 8) ratio = 2.60;
      


   
      vector<ll> temp2;
      ll cutoff = (long double) i.size() / ratio;




      FOR(j,0,cutoff){
        temp2.push_back(i[j]);
      }
      temp.push_back(temp2);
      temp2.clear();
   
      FOR(j, cutoff, i.size()){
        temp2.push_back(i[j]);
      }
      temp.push_back(temp2);
    }
    bot = temp;
    temp.clear();
   
   
   
   
   
    ll ind = 0;
   
   
   
    FOR(i,0,top.size()){

      ll tempflag = -1;


      if (sus%2 == 0){
        if (machine.count(bot[ind][0])) tempflag = (sus + 1)%2;
        else tempflag = sus%2;
      }else{
        if (machine.count(bot[ind][0])) tempflag = sus%2;
        else tempflag = (sus+1)%2;
      }
   
      if (top[i].size() == 1){
        ind += 1;
        temp.push_back(top[i]);
        continue;
      }


   
      vector<ll> first;
      vector<ll> second;
      ll curval = 0;
   

   
      for (auto&j : bot[ind]){
   
        curval = query(j);
   
      }
      ll idkman = top[i][top[i].size()-1];
      top[i].pop_back();

   
   
   
      for (auto&j : top[i]){
        ll result = query(j);
   
        if (result != curval){
          curval = result;
          first.push_back(j);
        }else{
          second.push_back(j);
        }
      }


      if (tempflag%2==1){
        
        if (first.size() != bot[ind].size()) first.push_back(idkman);
        else second.push_back(idkman);
        temp.push_back(first);
        temp.push_back(second);
      }
      else{

        if (second.size() != bot[ind].size()) second.push_back(idkman);
        else first.push_back(idkman);
        temp.push_back(second);
        temp.push_back(first);
   
      }
   
      ind += 2;
    }
   
    top = temp;
   
  }
   
  FOR(i,0,N){

   
    Answer((int) top[i][0],(int) bot[i][0]);
  }
   
   
   
   
   
 
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:51:51: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   while (!(top.size() == bot.size() && bot.size() == N)){
      |                                        ~~~~~~~~~~~^~~~
minerals.cpp:8:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define FOR(i, x, y) for(ll i=x; i<y; i++)
......
   79 |       FOR(j, cutoff, i.size()){
      |           ~~~~~~~~~~~~~~~~~~~      
minerals.cpp:79:7: note: in expansion of macro 'FOR'
   79 |       FOR(j, cutoff, i.size()){
      |       ^~~
minerals.cpp:8:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define FOR(i, x, y) for(ll i=x; i<y; i++)
......
   95 |     FOR(i,0,top.size()){
      |         ~~~~~~~~~~~~~~             
minerals.cpp:95:5: note: in expansion of macro 'FOR'
   95 |     FOR(i,0,top.size()){
      |     ^~~
minerals.cpp:25:6: warning: unused variable 'fuck' [-Wunused-variable]
   25 |   ll fuck = 0;
      |      ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 592 KB Output is correct
2 Correct 8 ms 976 KB Output is correct
3 Correct 17 ms 1552 KB Output is correct
4 Correct 38 ms 2920 KB Output is correct
5 Correct 83 ms 4856 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct
19 Correct 265 ms 13092 KB Output is correct
20 Correct 270 ms 13128 KB Output is correct
21 Correct 203 ms 13144 KB Output is correct
22 Correct 198 ms 13444 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct
19 Correct 265 ms 13092 KB Output is correct
20 Correct 270 ms 13128 KB Output is correct
21 Correct 203 ms 13144 KB Output is correct
22 Correct 198 ms 13444 KB Output is correct
23 Correct 278 ms 14948 KB Output is correct
24 Correct 276 ms 14944 KB Output is correct
25 Correct 218 ms 14936 KB Output is correct
26 Correct 213 ms 15392 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct
19 Correct 265 ms 13092 KB Output is correct
20 Correct 270 ms 13128 KB Output is correct
21 Correct 203 ms 13144 KB Output is correct
22 Correct 198 ms 13444 KB Output is correct
23 Correct 278 ms 14948 KB Output is correct
24 Correct 276 ms 14944 KB Output is correct
25 Correct 218 ms 14936 KB Output is correct
26 Correct 213 ms 15392 KB Output is correct
27 Correct 281 ms 14260 KB Output is correct
28 Correct 280 ms 15800 KB Output is correct
29 Correct 219 ms 15808 KB Output is correct
30 Correct 211 ms 15560 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct
19 Correct 265 ms 13092 KB Output is correct
20 Correct 270 ms 13128 KB Output is correct
21 Correct 203 ms 13144 KB Output is correct
22 Correct 198 ms 13444 KB Output is correct
23 Correct 278 ms 14948 KB Output is correct
24 Correct 276 ms 14944 KB Output is correct
25 Correct 218 ms 14936 KB Output is correct
26 Correct 213 ms 15392 KB Output is correct
27 Correct 281 ms 14260 KB Output is correct
28 Correct 280 ms 15800 KB Output is correct
29 Correct 219 ms 15808 KB Output is correct
30 Correct 211 ms 15560 KB Output is correct
31 Correct 316 ms 13904 KB Output is correct
32 Correct 296 ms 16044 KB Output is correct
33 Correct 219 ms 15384 KB Output is correct
34 Correct 221 ms 15292 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory 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 1 ms 336 KB Output is correct
5 Correct 4 ms 592 KB Output is correct
6 Correct 8 ms 976 KB Output is correct
7 Correct 17 ms 1552 KB Output is correct
8 Correct 38 ms 2920 KB Output is correct
9 Correct 83 ms 4856 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 54 ms 4084 KB Output is correct
12 Correct 87 ms 5448 KB Output is correct
13 Correct 68 ms 5244 KB Output is correct
14 Correct 68 ms 4908 KB Output is correct
15 Correct 291 ms 12688 KB Output is correct
16 Correct 261 ms 13752 KB Output is correct
17 Correct 197 ms 12896 KB Output is correct
18 Correct 208 ms 13388 KB Output is correct
19 Correct 265 ms 13092 KB Output is correct
20 Correct 270 ms 13128 KB Output is correct
21 Correct 203 ms 13144 KB Output is correct
22 Correct 198 ms 13444 KB Output is correct
23 Correct 278 ms 14948 KB Output is correct
24 Correct 276 ms 14944 KB Output is correct
25 Correct 218 ms 14936 KB Output is correct
26 Correct 213 ms 15392 KB Output is correct
27 Correct 281 ms 14260 KB Output is correct
28 Correct 280 ms 15800 KB Output is correct
29 Correct 219 ms 15808 KB Output is correct
30 Correct 211 ms 15560 KB Output is correct
31 Correct 316 ms 13904 KB Output is correct
32 Correct 296 ms 16044 KB Output is correct
33 Correct 219 ms 15384 KB Output is correct
34 Correct 221 ms 15292 KB Output is correct
35 Incorrect 259 ms 13168 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -