이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'
#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int t,n;
int Ask(int i,int j,vector<int> v){
int arr[n];
memset(arr,0,sizeof(arr));
for (auto &it:v) arr[it]=1;
return Ask(i,j,arr);
}
void rec(vector<int> v){
cout<<"debug: "; for (auto &it:v) cout<<it<<" "; cout<<endl;
}
void Detect(int T, int N) {
t=T,n=N;
if (t==1){
rep(x,0,n) rep(y,x+1,n){
if (Ask(x,y,{x,y})==1) Answer(x,y);
}
}
else{
vector<int> proc;
rep(x,0,n) proc.pub(x);
rec(proc);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |