oj.uz

답안 #815851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815851 2023-08-09T01:16:40 Z yeyso Minerals (JOI19_minerals) C++14
6 / 100
 9 ms 848 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int N) {
  int a = 0;
  int b = 0;
    //vector<vector<int>> res(2 * N + 1, vector<int>(15, 0));
    vector<int> res(2 * N + 1, 1);
    for(int k = 0; k < 15; k ++){
      for(int i = 1; i <= 2 * N; i ++){
          if(i & (1 << k)){
              a = Query(i);
          }
      }
      for(int i = 1; i <= 2 * N; i ++){
          b = Query(i);
          if(a == b){
              // Then b is paired with something where the kth bit is 1
              //res[a][k] = 1;
              
              res[i] += (1 << k);
          }
          b = Query(i);
      }
      for(int i = 1; i <= 2 * N; i ++){
        if(i & (1 << k)){
          a = Query(i);
        }
      }
    }
    set<pair<int, int>> ans;
    for(int i = 0; i < res.size(); i ++){
        ans.insert({min(i , res[i] -1), max(i , res[i] - 1)});
        //Answer(i, res[i]);
    }
    for(auto itx = ++ans.begin(); itx != ans.end(); ++itx){
        Answer((*itx).first, (*itx).second);
        //cout << (*itx).first << " " << (*itx).second << "\n";
    }


}

/*
g++ -std=gnu++17 -O2 -Wall -pipe -static -o minerals grader.cpp minerals.cpp
4
1 5
2 6
3 4
7 8



*/

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0; i < res.size(); i ++){
      |                    ~~^~~~~~~~~~~~

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 5 ms 592 KB Output is correct
4 Correct 7 ms 848 KB Output is correct
5 Incorrect 9 ms 720 KB Wrong Answer [2]
6 Halted 0 ms 0 KB -

Subtask #3
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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 Halted 0 ms 0 KB -

Subtask #4
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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 Halted 0 ms 0 KB -

Subtask #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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 Halted 0 ms 0 KB -

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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 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 0 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Incorrect 9 ms 720 KB Wrong Answer [2]
10 Halted 0 ms 0 KB -