oj.uz

Submission #792530

# Submission time Handle Problem Language Result Execution time Memory
792530 2023-07-25T06:29:35 Z beaconmc Minerals (JOI19_minerals) C++14
80 / 100
 263 ms 12396 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;
      }
      vector<ll> temp2;
      FOR(j,0,i.size()/2){
        temp2.push_back(i[j]);
      }
      temp.push_back(temp2);
      temp2.clear();
 
      FOR(j, i.size()/2, 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: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]
   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++)
......
   58 |       FOR(j,0,i.size()/2){
      |           ~~~~~~~~~~~~~~           
minerals.cpp:58:7: note: in expansion of macro 'FOR'
   58 |       FOR(j,0,i.size()/2){
      |       ^~~
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++)
......
   64 |       FOR(j, i.size()/2, i.size()){
      |           ~~~~~~~~~~~~~~~~~~~~~~~  
minerals.cpp:64:7: note: in expansion of macro 'FOR'
   64 |       FOR(j, i.size()/2, 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++)
......
   80 |     FOR(i,0,top.size()){
      |         ~~~~~~~~~~~~~~             
minerals.cpp:80:5: note: in expansion of macro 'FOR'
   80 |     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 3 ms 592 KB Output is correct
2 Correct 7 ms 848 KB Output is correct
3 Correct 14 ms 1420 KB Output is correct
4 Correct 34 ms 2592 KB Output is correct
5 Correct 80 ms 4532 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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 KB Output is correct
19 Correct 242 ms 11980 KB Output is correct
20 Correct 255 ms 12036 KB Output is correct
21 Correct 159 ms 12004 KB Output is correct
22 Correct 160 ms 11084 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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 KB Output is correct
19 Correct 242 ms 11980 KB Output is correct
20 Correct 255 ms 12036 KB Output is correct
21 Correct 159 ms 12004 KB Output is correct
22 Correct 160 ms 11084 KB Output is correct
23 Correct 256 ms 12392 KB Output is correct
24 Correct 263 ms 11368 KB Output is correct
25 Correct 172 ms 12396 KB Output is correct
26 Correct 163 ms 11220 KB Output is correct

Subtask #7
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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 KB Output is correct
19 Correct 242 ms 11980 KB Output is correct
20 Correct 255 ms 12036 KB Output is correct
21 Correct 159 ms 12004 KB Output is correct
22 Correct 160 ms 11084 KB Output is correct
23 Correct 256 ms 12392 KB Output is correct
24 Correct 263 ms 11368 KB Output is correct
25 Correct 172 ms 12396 KB Output is correct
26 Correct 163 ms 11220 KB Output is correct
27 Incorrect 238 ms 11436 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 KB Output is correct
19 Correct 242 ms 11980 KB Output is correct
20 Correct 255 ms 12036 KB Output is correct
21 Correct 159 ms 12004 KB Output is correct
22 Correct 160 ms 11084 KB Output is correct
23 Correct 256 ms 12392 KB Output is correct
24 Correct 263 ms 11368 KB Output is correct
25 Correct 172 ms 12396 KB Output is correct
26 Correct 163 ms 11220 KB Output is correct
27 Incorrect 238 ms 11436 KB Wrong Answer [2]
28 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 3 ms 592 KB Output is correct
6 Correct 7 ms 848 KB Output is correct
7 Correct 14 ms 1420 KB Output is correct
8 Correct 34 ms 2592 KB Output is correct
9 Correct 80 ms 4532 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 45 ms 3032 KB Output is correct
12 Correct 72 ms 4592 KB Output is correct
13 Correct 57 ms 4556 KB Output is correct
14 Correct 48 ms 4504 KB Output is correct
15 Correct 235 ms 11084 KB Output is correct
16 Correct 248 ms 11076 KB Output is correct
17 Correct 171 ms 11132 KB Output is correct
18 Correct 157 ms 10892 KB Output is correct
19 Correct 242 ms 11980 KB Output is correct
20 Correct 255 ms 12036 KB Output is correct
21 Correct 159 ms 12004 KB Output is correct
22 Correct 160 ms 11084 KB Output is correct
23 Correct 256 ms 12392 KB Output is correct
24 Correct 263 ms 11368 KB Output is correct
25 Correct 172 ms 12396 KB Output is correct
26 Correct 163 ms 11220 KB Output is correct
27 Incorrect 238 ms 11436 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -