oj.uz

답안 #792827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792827 2023-07-25T09:12:37 Z beaconmc Minerals (JOI19_minerals) C++14
80 / 100
 273 ms 12544 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, std::vector<std::vector<ll>> top, std::vector<std::vector<ll>> bot) {
  using namespace std;

  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]);
  }
}

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);
    }


    if (top[0].size() == bot[0].size()){
      solve(top[0].size(), top, bot);
      top = {{}};
      bot = {{}};
    }
  }






}

Compilation message

minerals.cpp: In function 'void solve(int, std::vector<std::vector<long long int> >, std::vector<std::vector<long long int> >)':
minerals.cpp:31: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]
   31 |   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++)
......
   41 |       FOR(j,0,i.size()/2){
      |           ~~~~~~~~~~~~~~           
minerals.cpp:41:7: note: in expansion of macro 'FOR'
   41 |       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++)
......
   47 |       FOR(j, i.size()/2, i.size()){
      |           ~~~~~~~~~~~~~~~~~~~~~~~  
minerals.cpp:47:7: note: in expansion of macro 'FOR'
   47 |       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++)
......
   60 |     FOR(i,0,top.size()){
      |         ~~~~~~~~~~~~~~             
minerals.cpp:60:5: note: in expansion of macro 'FOR'
   60 |     FOR(i,0,top.size()){
      |     ^~~

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 1 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 7 ms 976 KB Output is correct
3 Correct 16 ms 1504 KB Output is correct
4 Correct 33 ms 2668 KB Output is correct
5 Correct 71 ms 4764 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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 KB Output is correct
19 Correct 273 ms 11692 KB Output is correct
20 Correct 234 ms 11720 KB Output is correct
21 Correct 29 ms 5144 KB Output is correct
22 Correct 152 ms 11464 KB Output is correct

Subtask #6
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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 KB Output is correct
19 Correct 273 ms 11692 KB Output is correct
20 Correct 234 ms 11720 KB Output is correct
21 Correct 29 ms 5144 KB Output is correct
22 Correct 152 ms 11464 KB Output is correct
23 Correct 252 ms 12004 KB Output is correct
24 Correct 239 ms 11952 KB Output is correct
25 Correct 27 ms 5288 KB Output is correct
26 Correct 153 ms 11768 KB Output is correct

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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 KB Output is correct
19 Correct 273 ms 11692 KB Output is correct
20 Correct 234 ms 11720 KB Output is correct
21 Correct 29 ms 5144 KB Output is correct
22 Correct 152 ms 11464 KB Output is correct
23 Correct 252 ms 12004 KB Output is correct
24 Correct 239 ms 11952 KB Output is correct
25 Correct 27 ms 5288 KB Output is correct
26 Correct 153 ms 11768 KB Output is correct
27 Incorrect 239 ms 12544 KB Wrong Answer [2]
28 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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 KB Output is correct
19 Correct 273 ms 11692 KB Output is correct
20 Correct 234 ms 11720 KB Output is correct
21 Correct 29 ms 5144 KB Output is correct
22 Correct 152 ms 11464 KB Output is correct
23 Correct 252 ms 12004 KB Output is correct
24 Correct 239 ms 11952 KB Output is correct
25 Correct 27 ms 5288 KB Output is correct
26 Correct 153 ms 11768 KB Output is correct
27 Incorrect 239 ms 12544 KB Wrong Answer [2]
28 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 1 ms 336 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 16 ms 1504 KB Output is correct
8 Correct 33 ms 2668 KB Output is correct
9 Correct 71 ms 4764 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 46 ms 3264 KB Output is correct
12 Correct 75 ms 4868 KB Output is correct
13 Correct 14 ms 2120 KB Output is correct
14 Correct 60 ms 4760 KB Output is correct
15 Correct 223 ms 11372 KB Output is correct
16 Correct 222 ms 11396 KB Output is correct
17 Correct 25 ms 4936 KB Output is correct
18 Correct 147 ms 11096 KB Output is correct
19 Correct 273 ms 11692 KB Output is correct
20 Correct 234 ms 11720 KB Output is correct
21 Correct 29 ms 5144 KB Output is correct
22 Correct 152 ms 11464 KB Output is correct
23 Correct 252 ms 12004 KB Output is correct
24 Correct 239 ms 11952 KB Output is correct
25 Correct 27 ms 5288 KB Output is correct
26 Correct 153 ms 11768 KB Output is correct
27 Incorrect 239 ms 12544 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -