oj.uz

Submission #412127

# Submission time Handle Problem Language Result Execution time Memory
412127 2021-05-26T14:27:00 Z benedict0724 Library (JOI18_library) C++17
0 / 100
 55 ms 324 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <assert.h>
#include "library.h"
using namespace std;

vector<int> adj[1002];
int U[1002];
void Solve(int N)
{
	vector<int> M(N);
	M[0] = 1;
	int P = 1;
	for(int i = 1; i < N; i++) {
        int l = 0, r = i-1;
        M[i] = 1;
        int Q = Query(M);
        if(P < Q) { P = Q; continue; }

        while(l < r)
        {
            vector<int> v(N);
            int mid = (l + r)/2;
            for(int j=0;j<=mid;j++) v[j] = 1;
            int A, B;
            A = Query(v);
            v[i] = 1;
            B = Query(v);

            if(A >= B) r = mid;
            else l = mid+1;
        }
        adj[i].push_back(l);
        adj[l].push_back(i);

        if(P == Q) continue;
        l++; r = i-1;
        while(l < r)
        {
            vector<int> v(N);
            int mid = (l + r)/2;
            for(int j=0;j<=mid;j++) v[j] = 1;
            int A, B;
            A = Query(v);
            v[i] = 1;
            B = Query(v);
            if(A > B) r = mid;
            else l = mid+1;
        }

        adj[l].push_back(i);
        adj[i].push_back(l);
        P = Q;
	}

	vector<int> res(N);

	int st = -1;
	for(int i=0;i<N;i++) assert(adj[i].size() <= 2);
	int cnt = 0;
	for(int i=0;i<N;i++) if(adj[i].size() == 1) { st = i; cnt++; }
	// assert(cnt == 2);
    // assert(st >= 0);
	for(int i=0,now=st;i<N;i++)
    {
        res[i] = now+1;
        U[now] = 1;
        for(int nxt : adj[now])
        {
            if(!U[nxt])
            {
                now = nxt;
                break;
            }
        }
    }

	Answer(res);
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 324 KB # of queries: 2737
2 Correct 46 ms 304 KB # of queries: 2752
3 Correct 50 ms 200 KB # of queries: 2869
4 Correct 42 ms 200 KB # of queries: 2885
5 Correct 55 ms 200 KB # of queries: 2859
6 Correct 55 ms 200 KB # of queries: 2867
7 Correct 53 ms 200 KB # of queries: 2885
8 Correct 42 ms 200 KB # of queries: 2722
9 Correct 52 ms 320 KB # of queries: 2896
10 Correct 31 ms 200 KB # of queries: 1678
11 Incorrect 1 ms 200 KB Wrong Answer [5]
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 324 KB # of queries: 2737
2 Correct 46 ms 304 KB # of queries: 2752
3 Correct 50 ms 200 KB # of queries: 2869
4 Correct 42 ms 200 KB # of queries: 2885
5 Correct 55 ms 200 KB # of queries: 2859
6 Correct 55 ms 200 KB # of queries: 2867
7 Correct 53 ms 200 KB # of queries: 2885
8 Correct 42 ms 200 KB # of queries: 2722
9 Correct 52 ms 320 KB # of queries: 2896
10 Correct 31 ms 200 KB # of queries: 1678
11 Incorrect 1 ms 200 KB Wrong Answer [5]
12 Halted 0 ms 0 KB -