Submission #442911

#	Time^UTC-0	Username	Problem	Language	Result	Execution time	Memory
442911	2021-07-09 10:45:09	algorithm16	Game (IOI14_game)	C++14	0 / 100	1 ms	332 KiB

This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "game.h"
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int cnt[1505],cnt2[1505],ind,ind1[1505],x[1505],bio[1505][1505],n1;
void initialize(int n) {
  memset(ind1,-1,sizeof(ind1));
  n1=n;
}
int hasEdge(int u, int v) {
    int a=u,b=v,c=0,ret;
  bio[a][b]=1;
  bio[b][a]=1;
  if(ind1[a]!=-1 && ind1[b]!=-1 && ind1[a]>ind1[b]) swap(a,b);
  if(ind1[b]!=-1 && ind1[a]==-1) swap(a,b);
  //if(a==1 && b==2) cout << cnt[a] << " " << cnt2[a] << " " << ind1[a] << " " << ind << "\n";
  if(ind1[a]!=-1) {
    if(n1-1-cnt[a]>ind1[a]+1) ret=0;
    else ret=1;
    c=3;
  }
  if(ind1[a]==-1 && n1-1-cnt[a]==ind-cnt2[a]+1) {
    ret=1;
    ind1[a]=ind;
    for(int j=0;j<n1;j++) {
      if(bio[j][a]) cnt2[j]+=1;
    }
    ind+=1;
    c=1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Subtask 10 / 15

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 20 / 27

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 30 / 58

#	Verdict	Execution time	Memory	Grader output
Fetching results...