Submission #584941

#	Time	Username	Problem	Language	Result	Execution time	Memory
584941		Newtech66	Game (IOI14_game)	C++17	0 / 100	1 ms	212 KiB

game

#include<bits/stdc++.h>
using namespace std;
int n;
vector<set<int> > g;
map<pair<int,int>,bool> m; 
 
void initialize(int N)
{
    n=N;
    g.resize(n);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(i==j)    continue;
            g[i].insert(j);
        }
    }
}
 
int hasEdge(int u,int v)
{
  if(m.find({u,v})!=m.end())	return m[{u,v}];
    if(g[u].size()==1 || g[v].size()==1)
    {
      	m[{u,v}]=m[{v,u}]=1;
        g[u].erase(v);
        g[v].erase(u);
        return 1;
    }else
    {
      m[{u,v}]=m[{v,u}]=0;
        g[u].erase(v);
        g[v].erase(u);
        return 0;
    }
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58