Submission #628986

#	Time	Username	Problem	Language	Result	Execution time	Memory
628986		welleyth	Minerals (JOI19_minerals)	C++17	40 / 100	19 ms	2124 KiB

minerals

#include "minerals.h"
#include <vector>
#include <fstream>

void Solve(int N) {
    int col[2*N+1];
    for(int i = 0; i < 2*N+1; i++){
        col[i] = 0;
    }
    int c = 0;
    int in[N+1];
    for(int i = 0; i <= N; i++)
        in[i] = 0;
    int pos[N+1];
    bool is[2*N+1];
    bool was[2*N+1];
    for(int i = 0; i <= 2*N; i++) in[i] = was[i] = false;
    int sz = 0;
    int mx[2*N+1];
    for(int i = 0; i <= 2*N; i++) mx[i] = 0;
    for(int i = 1; i <= 2*N; i++){
        int cur = Query(i);
        if(cur != sz){
            sz = cur;
            pos[cur] = i;
            is[i] = 1;
            in[cur] = 1;
            col[i] = sz;
            was[i] = true;
        } else {
            sz = Query(i);
        }
        mx[i] = sz;
    }
    for(int bt = 0; (1 << bt) <= N; bt++){
        for(int i = 1; i <= N; i++){
            if(in[i] && (i >> bt & 1) == 0){
                sz = Query(pos[i]);
                in[i] = false;
            }
            if(!in[i] && (i >> bt & 1) == 1){
                sz = Query(pos[i]);
                in[i] = true;
            }
        }
        for(int i = 1; i <= 2*N; i++){
            if(was[i] || mx[i] < (1 << bt))
                continue;
            int nw = Query(i);
            if(nw == sz){
                col[i] |= (1 << bt);
            }
            sz = Query(i);
        }
    }
    std::vector<int> A[N+1];
    for(int i = 1; i <= 2*N; i++){
        A[col[i]].push_back(i);
    }
    for(int i = 1; i <= N; i++){
        Answer(A[i][0],A[i][1]);
    }
    return;
}
/**
4
1 5
2 6
3 4
7 8

**/

Compilation message (stderr)

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:10:9: warning: unused variable 'c' [-Wunused-variable]
   10 |     int c = 0;
      |         ^
minerals.cpp:15:10: warning: variable 'is' set but not used [-Wunused-but-set-variable]
   15 |     bool is[2*N+1];
      |          ^~

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 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