| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1340119 | thesentro | Permutation Game (APIO25_permgame) | C++20 | 0 ms | 344 KiB |
#include "permgame.h"
#include <vector>
#include <utility>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
std::vector<int> t(m);
for (int i = 0; i < m; i++){
t[i] = i;
}
ll id = 0;
while (id<n)
{
ll f = -1;
for (int i=0 ; i<n ; i++)
{
if (p[i]==id)
{
f = i;
break;
}
}
if (id!=f)
{
t[0] = id;
t[1] = f;
// cout<<id<<" "<<f<<endl;
int j = Bob(t);
swap(p[t[u[j]]], p[t[v[j]]]);
}
id++;
}
return n;
}
/*
2
1
0 1
5
4 0 2 3 1
*/| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
