QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738885 | #9176. Non-Interactive Nim | ucup-team134# | WA | 42ms | 4108kb | C++17 | 956b | 2024-11-12 20:10:04 | 2024-11-12 20:10:12 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128
using namespace std;
mt19937 rng(time(NULL));
void test(){
int n;
cin >> n;
vector<ll> a(n);
for(int i=0;i<n;i++)cin >> a[i];
vector<pair<int,int>> mvs;
for(int j=60;j>=0;j--){
ll b=1LL<<j;
vector<int> koji;
for(int i=0;i<n;i++){
if(a[i]&b){
koji.pb(i);
}
}
if(sz(koji)==0)continue;
if(sz(koji)>2){
printf("-1\n");
return;
}
mvs.pb({koji[0]+1,a[koji[0]]});
a[koji[1]]^=a[koji[0]];
a[koji[0]]=0;
}
printf("%i\n",sz(mvs));
for(auto p:mvs){
printf("%i %i\n",p.f,p.s);
}
}
int main()
{
ios;
int t;
cin >> t;
while(t--){
test();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3916kb
input:
2 4 4 2 7 1 4 1 1 1 1
output:
3 1 4 2 2 3 1 -1
result:
ok OK 1 yes 1 no (2 test cases)
Test #2:
score: 0
Accepted
time: 25ms
memory: 4108kb
input:
50000 2 3 3 2 2 2 2 3 3 2 2 2 2 3 3 2 3 3 2 1 1 2 1 1 2 1 1 2 2 2 2 2 2 2 3 3 2 2 2 2 1 1 2 3 3 2 1 1 2 1 1 2 1 1 2 3 3 2 1 1 2 1 1 2 3 3 2 2 2 2 3 3 2 3 3 2 2 2 2 1 1 2 3 3 2 2 2 2 2 2 2 3 3 2 3 3 2 1 1 2 1 1 2 1 1 2 3 3 2 3 3 2 1 1 2 1 1 2 3 3 2 2 2 2 2 2 2 2 2 2 1 1 2 1 1 2 2 2 2 2 2 2 1 1 2 3 3 ...
output:
1 1 3 1 1 2 1 1 3 1 1 2 1 1 3 1 1 3 1 1 1 1 1 1 1 1 1 1 1 2 1 1 2 1 1 3 1 1 2 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 3 1 1 2 1 1 3 1 1 3 1 1 2 1 1 1 1 1 3 1 1 2 1 1 2 1 1 3 1 1 3 1 1 1 1 1 1 1 1 1 1 1 3 1 1 3 1 1 1 1 1 1 1 1 3 1 1 2 1 1 2 1 1 2 1 1 1 1 1 1 1 1 2 1 1 2 1 1 1 1 1 3 1 1 3 ...
result:
ok OK 50000 yes 0 no (50000 test cases)
Test #3:
score: -100
Wrong Answer
time: 42ms
memory: 3880kb
input:
50000 2 89846347117873058 89846347117873058 2 416235892302498917 416235892302498917 2 332154513003612985 332154513003612985 2 43960216631774959 43960216631774959 2 353215896487285554 353215896487285554 2 38296945667390613 38296945667390613 2 209150071115726640 209150071115726640 2 48610805835417777 ...
output:
1 1 -732706910 1 1 -1217049499 1 1 236948281 1 1 -2003431697 1 1 -2027597006 1 1 -2105754475 1 1 -1382432976 1 1 907069617 1 1 -1590423279 1 1 -184398503 1 1 1362194955 1 1 -538128596 1 1 -1851726319 1 1 1712060750 1 1 1654165883 1 1 -1342859856 1 1 -1453378331 1 1 401622420 1 1 -664206506 1 1 -2108...
result:
wrong answer Integer parameter [name=x] equals to -732706910, violates the range [1, 89846347117873058] (test case 1)