This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
int m;
long long query () {
vector<int> V;
for(int i=0;i<m;i++) {
V.push_back(0);
}
return ask(V);
}
void find_pair(int _N, vector<int> _U, vector<int> _V, int _A, int _B) {
m = (int)_U.size();
for(int i=0;i<100;i++) {
query();
}
answer(1, 3);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |