Submission #1221815

#TimeUsernameProblemLanguageResultExecution timeMemory
1221815brintonPermutation Game (APIO25_permgame)C++20
6 / 100
1 ms328 KiB
#include "permgame.h" #include <bits/stdc++.h> using namespace std; /* m: vertices in u,v e: edges in u,v n: permutation length; */ int Alice(int m, int e, vector<int> u, vector<int> v, int N, vector<int> p) { int already = 0; int ans; for(int i = 0;i < N;i++) if(p[i]==i) already++; if(e > m) { return already; }else if(e == m-1){ set<int> s; for(int i = 0;i < N;i++) if(p[i] != i) s.insert(i); while(s.size() >= m){ vector<int> t(s.begin(),next(s.begin(),m)); int j = Bob(t); swap(p[t[u[j]]], p[t[v[j]]]); } return N-m; } }

Compilation message (stderr)

permgame.cpp: In function 'int Alice(int, int, std::vector<int>, std::vector<int>, int, std::vector<int>)':
permgame.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...