제출 #1148712

#제출 시각아이디문제언어결과실행 시간메모리
1148712yeysoMinerals (JOI19_minerals)C++20
0 / 100
0 ms416 KiB
#include "minerals.h" #include <bits/stdc++.h> using namespace std; void Solve(int N) { int cur = 0; int prev = 0; int x = log2(N) + 1; //cout << x << " "; vector<int> binary(N + 1, N + 1); for(int bit = 0; bit < x; bit ++){ for(int i = 0; i < N; i ++){ if(i & (1 << bit)){ prev = Query(i + N + 1); } } //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 = 0; i < N; i ++){ if(i & (1 << bit)){ //prev = Query(i + N + 1); } } } 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 20 3 18 5 16 7 14 9 12 2 11 4 13 6 15 8 17 10 19 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 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...