oj.uz

Submission #796336

# Submission time Handle Problem Language Result Execution time Memory
796336 2023-07-28T09:55:29 Z beaconmc Minerals (JOI19_minerals) C++14
85 / 100
 276 ms 13980 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) {
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() >= 10) ratio = 2.5;

    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 (top[i].size() == 1){
      ind += 1;
      temp.push_back(top[i]);
      continue;
    }


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

    if (sus%2 == 0){
      if (machine.count(bot[ind][0])) tempflag = (sus + 1)%2;
      else tempflag = sus;
    }else{
      if (machine.count(bot[ind][0])) tempflag = sus;
      else tempflag = (sus+1)%2;
    }

    for (auto&j : bot[ind]){

      curval = query(j);

    }



    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){
      temp.push_back(first);
      temp.push_back(second);
    }
    else{
      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:48:49: 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]
   48 | 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++)
......
   68 |     FOR(j, cutoff, i.size()){
      |         ~~~~~~~~~~~~~~~~~~~        
minerals.cpp:68:5: note: in expansion of macro 'FOR'
   68 |     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++)
......
   84 |   FOR(i,0,top.size()){
      |       ~~~~~~~~~~~~~~               
minerals.cpp:84:3: note: in expansion of macro 'FOR'
   84 |   FOR(i,0,top.size()){
      |   ^~~

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 1616 KB Output is correct
4 Correct 43 ms 2976 KB Output is correct
5 Correct 79 ms 5156 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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 KB Output is correct
19 Correct 252 ms 13488 KB Output is correct
20 Correct 260 ms 13544 KB Output is correct
21 Correct 202 ms 13564 KB Output is correct
22 Correct 181 ms 13388 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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 KB Output is correct
19 Correct 252 ms 13488 KB Output is correct
20 Correct 260 ms 13544 KB Output is correct
21 Correct 202 ms 13564 KB Output is correct
22 Correct 181 ms 13388 KB Output is correct
23 Correct 264 ms 13784 KB Output is correct
24 Correct 262 ms 13824 KB Output is correct
25 Correct 187 ms 13556 KB Output is correct
26 Correct 188 ms 13732 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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 KB Output is correct
19 Correct 252 ms 13488 KB Output is correct
20 Correct 260 ms 13544 KB Output is correct
21 Correct 202 ms 13564 KB Output is correct
22 Correct 181 ms 13388 KB Output is correct
23 Correct 264 ms 13784 KB Output is correct
24 Correct 262 ms 13824 KB Output is correct
25 Correct 187 ms 13556 KB Output is correct
26 Correct 188 ms 13732 KB Output is correct
27 Correct 276 ms 13892 KB Output is correct
28 Correct 270 ms 13892 KB Output is correct
29 Correct 194 ms 13808 KB Output is correct
30 Correct 205 ms 13624 KB Output is correct

Subtask #8
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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 KB Output is correct
19 Correct 252 ms 13488 KB Output is correct
20 Correct 260 ms 13544 KB Output is correct
21 Correct 202 ms 13564 KB Output is correct
22 Correct 181 ms 13388 KB Output is correct
23 Correct 264 ms 13784 KB Output is correct
24 Correct 262 ms 13824 KB Output is correct
25 Correct 187 ms 13556 KB Output is correct
26 Correct 188 ms 13732 KB Output is correct
27 Correct 276 ms 13892 KB Output is correct
28 Correct 270 ms 13892 KB Output is correct
29 Correct 194 ms 13808 KB Output is correct
30 Correct 205 ms 13624 KB Output is correct
31 Incorrect 238 ms 12336 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

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 1616 KB Output is correct
8 Correct 43 ms 2976 KB Output is correct
9 Correct 79 ms 5156 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 52 ms 3928 KB Output is correct
12 Correct 80 ms 5340 KB Output is correct
13 Correct 62 ms 5248 KB Output is correct
14 Correct 60 ms 5188 KB Output is correct
15 Correct 244 ms 13872 KB Output is correct
16 Correct 244 ms 13904 KB Output is correct
17 Correct 180 ms 13980 KB Output is correct
18 Correct 171 ms 13736 KB Output is correct
19 Correct 252 ms 13488 KB Output is correct
20 Correct 260 ms 13544 KB Output is correct
21 Correct 202 ms 13564 KB Output is correct
22 Correct 181 ms 13388 KB Output is correct
23 Correct 264 ms 13784 KB Output is correct
24 Correct 262 ms 13824 KB Output is correct
25 Correct 187 ms 13556 KB Output is correct
26 Correct 188 ms 13732 KB Output is correct
27 Correct 276 ms 13892 KB Output is correct
28 Correct 270 ms 13892 KB Output is correct
29 Correct 194 ms 13808 KB Output is correct
30 Correct 205 ms 13624 KB Output is correct
31 Incorrect 238 ms 12336 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -