Submission #115248

#	Time	Username	Problem	Language	Result	Execution time	Memory
115248		andremfq	Game (IOI14_game)	C++17	100 / 100	510 ms	27640 KiB

game

//Oda codou mas a ideia eh minha
#include<bits/stdc++.h>
using namespace std;
#include "game.h"
const int MAXN=1510,MAXL=13;
pair<int,int> v[MAXN][MAXN];
int v1[MAXN][MAXL];
void initialize(int n)
{
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int k=0,k1=0;
//int x=i^j;
//k=__builtin_ctz(x);
for(int l=0;l<MAXL;l++)
{
if(((1<<l)&i)!=((1<<l)&j))
{
k1=l;
break;
}
k+=((1<<l)&i);
}
v1[k][k1]++;
v[i][j]=make_pair(k,k1);v[j][i]=make_pair(k,k1);
}
}
}
int hasEdge(int a,int b)
{
if(v1[v[a][b].first][v[a][b].second]<=1)
{
return 1;
}
else 
{
v1[v[a][b].first][v[a][b].second]--;
return 0;
}
}
/*int main()
{
int n;
scanf("%d",&n);
initialize(n);
for(int i=0;i<n;i++)printf("%d ",v1[i]);
printf("\n");
int k=n*(n-1);
k/=2;
for(int i=0;i<k;i++)
{
int a,b;
scanf("%d %d",&a,&b);
printf("%d\n",hasEdge(a,b));
}
}*/

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