Submission #997324

#	Time	Username	Problem	Language	Result	Execution time	Memory
997324		12345678	Minerals (JOI19_minerals)	C++17	40 / 100	23 ms	6656 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=5e4+5;

int n, p, c, l[nx], r[nx], t;
vector<int> used, v, qrs[nx];

void Solve(int N) {
    v.push_back(0);
    used.push_back(0);
    for (int i=1; i<=2*N; i++)
    {
        c=Query(i);
        if (c==p) v.push_back(i);
        else used.push_back(i), p=c;
    }
    for (int i=1; i<=N; i++) l[i]=1, r[i]=N;
    while (++t)
    {
        bool f=1;
        for (int i=1; i<=N; i++) qrs[i].clear();
        for (int i=1; i<=N; i++) if (l[i]!=r[i]) f=0, qrs[(l[i]+r[i])/2].push_back(i);
        if (f) break;
        //cout<<"bsearch\n";
        //for (int i=1; i<=N; i++) cout<<i<<' '<<v[i]<<' '<<l[i]<<' '<<r[i]<<'\n';
        if (t%2)
        {
            p=N;
            for (int i=N; i>=1; i--)
            {
                for (auto x:qrs[i])
                {
                    //cout<<"here "<<x<<' '<<p<<'\n';
                    if (Query(v[x])==p) r[x]=i;
                    else l[x]=i+1, p--;
                }
                p=Query(used[i]);
            }
        }
        else
        {
            p=0;
            for (int i=1; i<=N; i++)
            {
                p=Query(used[i]);
                for (auto x:qrs[i])
                {
                    if (Query(v[x])==p) r[x]=i;
                    else l[x]=i+1, p++;
                }
            }
        }
    }
    for (int i=1; i<=N; i++) Answer(v[i], used[l[i]]);
}

• 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