| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 995027 |
2024-06-08T10:53:17 Z |
Bula |
Library (JOI18_library) |
C++17 |
|
321 ms |
676 KB |
#include "library.h"
#include <bits/stdc++.h>
using namespace std;
//namespace {
//struct Judge
//{
// int N;
// int A[1002];
// int pos[1002];
// bool f[1002];
// int query_c;
// bool answered;
// void init()
// {
// query_c=0;
// int ret=scanf("%d",&N); ret++;
// answered=false;
// for(int i=0;i<N;i++)ret=scanf("%d",&A[i]),pos[A[i]]=i;
// }
// int query(const vector<int>& M)
// {
// if(query_c==20000)
// {
// puts("Wrong Answer [3]");
// exit(0);
// }
// if(int(M.size())!=N)
// {
// puts("Wrong Answer [1]");
// exit(0);
// }
// bool all_zero=true;
// for(int i=0;i<N;i++)
// {
// if(M[i]!=0&&M[i]!=1)
// {
// puts("Wrong Answer [2]");
// exit(0);
// }
// if(M[i]==1)all_zero=false;
// }
// if(all_zero)
// {
// puts("Wrong Answer [2]");
// exit(0);
// }
// memset(f,0,sizeof(f));
// for(int i=0;i<N;i++)if(M[i])f[pos[i+1]]=true;
// bool las=false;
// int r=0;
// for(int i=0;i<N;i++)
// {
// if(las==false&&f[i]==true)r++;
// las=f[i];
// }
// query_c++;
// return r;
// }
// void answer(const vector<int>& res)
// {
// bool f1=true,f2=true;
// if(int(res.size())!=N)
// {
// puts("Wrong Answer　[4]");
// exit(0);
// }
// if(answered)
// {
// puts("Wrong Answer [7]");
// exit(0);
// }
// answered=true;
// memset(f,0,sizeof(f));
// for(int i=0;i<N;i++)
// {
// if(res[i]<=0||res[i]>N)
// {
// puts("Wrong Answer [5]");
// exit(0);
// }
// if(f[res[i]])
// {
// puts("Wrong Answer [6]");
// exit(0);
// }
// f[res[i]]=true;
// }
// for(int i=0;i<N;i++)
// {
// f1&=A[i]==res[i];
// f2&=A[i]==res[N-i-1];
// }
// if(!f1&&!f2)
// {
// puts("Wrong Answer　[8]");
// exit(0);
// }
// }
// void end()
// {
// if(!answered)puts("Wrong Answer [7]");
// else printf("Accepted : %d\n",query_c);
// }
//}judge;
//}
//
//int Query(const vector<int>& M)
//{
// return judge.query(M);
//}
//void Answer(const vector<int>& res)
//{
// judge.answer(res);
//}
int N;
vector<int> p, b;
int ask(int l, int r, int idx){
//cout << l << " " << r << " " << idx << endl
l--, r--; idx--; for(int i = 0; i < N; i++) p[i] = 0;
for(int i = max(l, 0); i <= min(r, N - 1); i++) p[i] = 1;
if(idx >= 0) p[idx] = 1;
for(auto x : b) if(x > 0) p[x - 1] = 0;
int ok = 0;
for(int i = 0; i < N; i++) if(p[i]) ok = 1;
if(!ok) return -1;
//cout << Query(p) << endl;
return Query(p);
}
void Solve(int n){
p.resize(n);
int cur = 1; N = n;
for(int i = 1; i <= n; i++){
b.push_back(i);
if(ask(1, n, 0) == 1){
cur = i; break;
}
if(b.size() > 0) b.clear();
}
if(b.size() > 0) b.clear();
vector<int> ans = {cur};
for(int i = 1; i <= n; i++){
int l = 1, r = cur - 1, pas = 0;
while(l < r){
int m = (l + r) / 2;
if(ask(1, m, cur) == ask(1, m, 0)) r = m;
else l = m + 1;
}
if(l == r && ask(1, l, cur) == ask(1, l, 0)){
ans.push_back(l); pas = l;
}
if(!pas){
l = cur + 1, r = n;
while(l < r){
int m = (l + r + 1) / 2;
if(ask(m, n, cur) == ask(m, n, 0)) l = m;
else r = m - 1;
}
if(l == r && ask(l, n, cur) == ask(l, n, 0)){
ans.push_back(l); pas = l;
}
}
b.push_back(cur); cur = pas;
}
Answer(ans);
}
//int main()
//{
// judge.init();
// Solve(judge.N);
// judge.end();
//}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
38 ms |
440 KB |
# of queries: 4104 |
| 2 |
Correct |
34 ms |
596 KB |
# of queries: 4107 |
| 3 |
Correct |
51 ms |
432 KB |
# of queries: 4530 |
| 4 |
Correct |
40 ms |
344 KB |
# of queries: 4428 |
| 5 |
Correct |
35 ms |
344 KB |
# of queries: 4313 |
| 6 |
Correct |
43 ms |
600 KB |
# of queries: 4322 |
| 7 |
Correct |
44 ms |
432 KB |
# of queries: 4389 |
| 8 |
Correct |
34 ms |
344 KB |
# of queries: 4247 |
| 9 |
Correct |
38 ms |
344 KB |
# of queries: 4362 |
| 10 |
Correct |
21 ms |
344 KB |
# of queries: 2600 |
| 11 |
Correct |
0 ms |
344 KB |
# of queries: 0 |
| 12 |
Correct |
0 ms |
344 KB |
# of queries: 4 |
| 13 |
Correct |
0 ms |
344 KB |
# of queries: 10 |
| 14 |
Correct |
0 ms |
344 KB |
# of queries: 17 |
| 15 |
Correct |
1 ms |
344 KB |
# of queries: 149 |
| 16 |
Correct |
2 ms |
344 KB |
# of queries: 323 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
38 ms |
440 KB |
# of queries: 4104 |
| 2 |
Correct |
34 ms |
596 KB |
# of queries: 4107 |
| 3 |
Correct |
51 ms |
432 KB |
# of queries: 4530 |
| 4 |
Correct |
40 ms |
344 KB |
# of queries: 4428 |
| 5 |
Correct |
35 ms |
344 KB |
# of queries: 4313 |
| 6 |
Correct |
43 ms |
600 KB |
# of queries: 4322 |
| 7 |
Correct |
44 ms |
432 KB |
# of queries: 4389 |
| 8 |
Correct |
34 ms |
344 KB |
# of queries: 4247 |
| 9 |
Correct |
38 ms |
344 KB |
# of queries: 4362 |
| 10 |
Correct |
21 ms |
344 KB |
# of queries: 2600 |
| 11 |
Correct |
0 ms |
344 KB |
# of queries: 0 |
| 12 |
Correct |
0 ms |
344 KB |
# of queries: 4 |
| 13 |
Correct |
0 ms |
344 KB |
# of queries: 10 |
| 14 |
Correct |
0 ms |
344 KB |
# of queries: 17 |
| 15 |
Correct |
1 ms |
344 KB |
# of queries: 149 |
| 16 |
Correct |
2 ms |
344 KB |
# of queries: 323 |
| 17 |
Runtime error |
321 ms |
676 KB |
Execution killed with signal 13 |
| 18 |
Halted |
0 ms |
0 KB |
- |
