oj.uz

Submission #930557

# Submission time Handle Problem Language Result Execution time Memory
930557 2024-02-20T06:42:32 Z vjudge1 Game (IOI14_game) C++17
0 / 100
 1 ms 2644 KB 
#include<bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define ll long long
#define maksim gay
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back

const int MAX=1500+10;
const int inf=2e9;
const int N=2e5;
const int mod=998244353;

int binpow(int a,int n){
  if(n==0)return 1;
  if(n%2)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

int m;
int d[MAX][MAX];
int f[MAX];

int get(int v){
  if(f[v]==v)return v;
  return f[v]=get(f[v]);
}

void unite(int u,int v){
  u=get(u);
  v=get(v);
  for(int i=0;i<m;i++){
    if(i==u||i==v)continue;
    d[u][i]+=d[v][i];
    d[i][u]+=d[i][v];
    d[v][i]=0;
    d[i][v]=0;
  }
  f[v]=u;
}

void initialize(int n) {
  m=n;
  for(int i=0;i<n;i++){
    f[i]=i;
    for(int j=0;j<n;j++){
      if(i!=j)d[i][j]=1;
    }
  }
}

int hasEdge(int u, int v) {
  u=get(u);
  v=get(v);
  if(u==v){
    return 0;
  }
  if(d[u][v]==1){
    d[u][v]--;
    unite(u,v);
    return 1;
  }
  else{
    d[u][v]--;
    return 0;
  }
}


// signed main()
// {
//   int n;
//   int k;

//   int i, j;  
//   int status = 0;

//   cin>>n>>k;
//   int op[k],left[k],height[k],right[k+1],finalHeight[n+1];

//   for (i = 0; i < k; i++){
//     cin>>op[i]>>left[i]>>right[i]>>height[i];
//   }

//   buildWall(n, k, op, left, right, height, finalHeight);

//   // for (j = 0; j < n; j++)
//   //   printf("%d\n", finalHeight[j]);
  
//   // return 0;
// }

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Incorrect 0 ms 2492 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2548 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -