제출 #1148880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148880		yeyso	Minerals (JOI19_minerals)	C++20	25 / 100	5 ms	792 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int N) {
    int cur = 0;
    int prev = 0;
    int x = log2(2 * N) + 1;
    //cout << x << " ";
    vector<int> binary(N + 1, 0);
    for(int bit = 0; bit < x; bit ++){ 
        for(int i = N + 1; i <= 2 * N; i ++){
            /*if(i != 0){
                // if we need to remove the bit
                if(i & (1 << (bit - 1)) && !(i & (1 << bit))){
                    Query(i + N + 1);
                }
            }*/
            if(i & (1 << bit)){
                prev = Query(i);
                //cout << 1 << " ";
            } else {
                //cout << 0 << " ";
            }
        } //cout << "\n";
        for(int i = 1; i <= N; i ++){
            cur = Query(i);
            if(cur == prev){
                binary[i] += (1 << bit);
            }
            prev = Query(i);
        }
        for(int i = N + 1; i <= 2 * N; i ++){
            if(i & (1 << bit)){
                prev = Query(i);
            }
        }

       
    }
    for(int i = 1; i <= N; i ++){
        //cout << binary[i] << " ";
        Answer(i, binary[i]);
    }
}
/*
g++ -std=gnu++17 -O2 -o minerals grader.cpp minerals.cpp
10
1 17
2 14
3 12
4 19
5 13
6 15
7 11
8 16
9 18
10 20

7
3 14
1 12
5 11
7 13
4 10
2 16
6 15

10
1 17
2 14
3 12
4 19
5 13
6 15
7 11
8 16
9 18
10 20
*/

• Subtask 1: 0 / 6
• Subtask 2: 25 / 25
• Subtask 3: 0 / 9
• Subtask 4: 0 / 30
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10