# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157943 | alexdd | Werewolf (IOI18_werewolf) | C++20 | 625 ms | 61468 KiB |
#include "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> con[200005];
int poz[200005];
pair<int,int> forL[400005],forR[400005];
vector<int> withL[400005],withR[400005];
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
std::vector<int> S, std::vector<int> E,
std::vector<int> L, std::vector<int> R) {
for(int i=0;i<L.size();i++)
{
withL[L[i]].push_back(i);
withR[R[i]].push_back(i);
}
for(int i=0;i<X.size();i++)
{
con[X[i]].push_back(Y[i]);
con[Y[i]].push_back(X[i]);
}
int cap=-1;
for(int i=0;i<N;i++)
if((int)con[i].size()==1)
cap = i;
vector<int> lant;
lant.push_back(cap);
for(int i=1;i<N;i++)
{
if(i-2>=0 && con[lant[i-1]][0] == lant[i-2])
# | 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... |