제출 #251031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251031		IsaacMoris	Minerals (JOI19_minerals)	C++14	40 / 100	46 ms	7540 KiB

minerals

#include<iostream>
#include <bits/stdc++.h>
#include "minerals.h"
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int low[100009], high[100009];
vector<int> v[100009];

void Solve(int N)
{
    vector<int> v1, v2;
    int last=0;
    for (int i = 1; i <= 2 * N; ++i)
    {
        int x=Query(i);
        if(x!=last)
            v1.push_back(i);
        else
            v2.push_back(i);
        last=x;
    }
    for(int i=0; i<N; i++)
        high[i]=N-1, low[i]=0;
    int good=1;
    bool p=1;
    while(good)
    {
        good=0;
        for(int i=0; i<N; i++)
            if(low[i]<=high[i])
                v[low[i]+ (high[i]-low[i])/2].push_back(i);
        for(int i=0; i<N; i++)
        {

            int x=Query(v1[i]);
            while(!v[i].empty())
            {
                int id=v[i].back();

                good=1;
                v[i].pop_back();
                int q=Query(v2[id]);
                if((q!=x && p) || (q==x && !p))
                    high[id]=i-1;
                else
                    low[id]=i+1;
                x=q;
            }
        }
        p=!p;
    }
    for(int i=0; i<N; i++)
        Answer(v2[i], v1[high[i]+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