| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1340676 | michael12 | Coins (IOI17_coins) | C++20 | 5 ms | 580 KiB |
#include "coins.h"
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<algorithm>
#include<cmath>
using namespace std;
#define ff first
#define ss second
const int maxn = 5e5;
int maxq = 29;
vector<int> coin_flips(vector<int> b, int c){
int cur = 0;
for(int i = 0; i < 64; i++){
if(b[i] == 1){
cur ^= i;
}
}
int F = cur ^ c;
b[F] = 1 - b[F];
return {F};
}
int find_coin(vector<int> b){
int cur = 0;
for(int i = 0; i < 64; i++){
if(b[i] == 1){
cur ^= i;
}
}
return cur;
}Compilation message (stderr)
| # | 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... | ||||
