QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#554556 | #8239. Mysterious Tree | Rafat_Kabir | WA | 1ms | 3892kb | C++20 | 4.1kb | 2024-09-09 12:04:35 | 2024-09-09 12:04:36 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod = 1e9+7, MOD = 998244353;
double eps = 1e-12;
// #define forn(i,e) for(ll i = 0; i < e; i++)
#define FOR(s, e, i) for(int i = s; i <= e; i++)
// #define rforn(i,s) for(ll i = s; i >= 0; i--)
#define ROF(s ,e, i) for(int i = s; i >= e; i--)
#define coutAll(A) for(auto asdafas : A) cout << asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout << asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >> asdafas;
#define finAll(A) for(auto &asdafas : A) fin >> asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll>
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
//#define MAXN 1000000
void solve(int it)
{
// std::random_device rd; // Obtain a random number from hardware
// std::mt19937 gen(rd()); // Seed the generator
int n;
// std::uniform_int_distribution<> distr(0, n-1);
srand(time(NULL));
cin >> n;
int u, v;
set<p64>s;
FOR(1, (n+1)/2, i){
int a = 0;
int b = (rand()%n+n)%n;
while(a==b||s.count({a, b})) b=(rand()%n+n)%n;
cout << "? " << a+1 << " " << b+1 << endl;
// cout.flush();
s.insert({a, b});
s.insert({b, a});
bool ok;
cin >> ok;
if(ok){
u = a, v = b;
}
}
v32 A;
FOR(0, n - 1, i){
if(i == u) continue;
if(i == v) continue;
A.pb(i);
}
cout << "? " << u+1 << " " << A[0]+1 << endl;
// cout.flush();
bool ok; cin >> ok;
if(ok){
cout << "? " << u+1 << " " << A[1]+1 << endl;
// cout.flush();
cin >> ok;
cout << (ok ? "! 2" : "! 1") << endl;
// cout.flush();
return;
}
cout << "? " << v+1 << " " << A[0]+1 << endl;
cin >> ok;
// cout.flush();
if(ok){
cout << "? " << v+1 << " " << A[1]+1 << endl;
// cout.flush();
cin >> ok;
cout << (ok ? "! 2" : "! 1") << endl;
// cout.flush();
return;
}
cout <<"! 1"<< endl;
}
int main()
{
fast_cin();
ll t = 1;
cin >> t;
for(int it=1; it<=t; it++)
{
//cout << "Case " << it << ": ";
solve(it);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3728kb
input:
2 4 0 0 1 0 4 1 0 0 1 1
output:
? 1 3 ? 1 4 ? 1 2 ? 1 3 ! 1 ? 1 3 ? 1 4 ? 1 2 ? 3 2 ? 3 4 ! 2
result:
ok Correct (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3892kb
input:
87 13 0 0 0 0 0 0 0 0
output:
? 1 2 ? 1 5 ? 1 8 ? 1 13 ? 1 3 ? 1 6 ? 1 9 ? 1 2 ? 0 2
result:
wrong answer Integer 0 violates the range [1, 13] (test case 1)