oj.uz

Submission #911288

# Submission time Handle Problem Language Result Execution time Memory
911288 2024-01-18T17:53:40 Z contest_alt Game (IOI14_game) C++17
42 / 100
 1000 ms 4696 KB 
#include "game.h"

#include <random>
#include <time.h>
#include <algorithm>

const int SIZ = 300;
const int MAXN = SIZ * SIZ;

bool viz[SIZ];

struct Component {
  int adj[SIZ][SIZ];

  int n;

  void init( int N ) {
    n = N;

    for( int i = 0 ; i < n ; i++ ){
      for( int j = 0 ; j < n ; j++ )
        adj[i][j] = 1;
      adj[i][i] = 0;
    }
  }

  void remove_edge( int u, int v ) { adj[u][v] = adj[v][u] = 0; }
  void insert_edge( int u, int v ) { adj[u][v] = adj[v][u] = 1; }

  void dfs( int u ) {
    viz[u] = true;

    for( int v = 0 ; v < n ; v++ )
      if( !viz[v] && adj[u][v] )
        dfs( v );
  }

  bool connected( int u, int v ) {
    for( int i = 0 ; i < n ; i++ )
      viz[i] = false;

    dfs( u );

    return viz[v];
  }
};

namespace Solver {
  Component local[SIZ];
  int csiz[SIZ];
  
  Component global;

  int comp[MAXN];
  int comp_idx[MAXN];

  int edge_tracker[SIZ][SIZ];

  int n;
  int ncomp;

  void init( int N ) {
    n = N;

    std::mt19937 rng( clock() );

    for( int i = 0 ; i < n ; i++ ){
      comp[i] = i / SIZ;
      comp_idx[i] = i % SIZ;
      csiz[comp[i]]++;
    }

    for( int i = 0 ; i + 1 < n ; i++ ){
      int j = i + rng() % (n - i);

      std::swap( comp[i], comp[j] );
      std::swap( comp_idx[i], comp_idx[j] );
    }

    ncomp = (n - 1) / SIZ + 1;
    for( int i = 0 ; i < ncomp ; i++ )
      local[i].init( csiz[i] );

    global.init( ncomp );

    for( int i = 0 ; i < ncomp ; i++ )
      for( int j = i + 1 ; j < ncomp ; j++ )
        edge_tracker[i][j] = edge_tracker[j][i] = csiz[i] * csiz[j];
  }

  bool query( int u, int v ) {
    // problema locala?
    if( comp[u] == comp[v] ) {
      int C = comp[u];
      int a = comp_idx[u], b = comp_idx[v];
      
      local[C].remove_edge( a, b );

      if( local[C].connected( a, b ) )
        return false;

      local[C].insert_edge( a, b );
      return true;
    }

    // problema globala
    int U = comp[u], V = comp[v];
    if( edge_tracker[U][V] > 1 ){
      edge_tracker[U][V]--;
      return false;
    }

    global.remove_edge( U, V );

    if( global.connected( U, V ) )
      return false;

    global.insert_edge( U, V );
    return true;
  }
}

void initialize( int n ) { Solver::init( n ); }

int hasEdge( int u, int v ) { return Solver::query( u, v ); }

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 3 ms 4444 KB Output is correct
29 Correct 2 ms 4440 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 26 ms 4548 KB Output is correct
35 Correct 30 ms 4540 KB Output is correct
36 Correct 34 ms 4444 KB Output is correct
37 Correct 42 ms 4524 KB Output is correct
38 Correct 26 ms 4552 KB Output is correct
39 Correct 42 ms 4444 KB Output is correct
40 Correct 26 ms 4440 KB Output is correct
41 Correct 27 ms 4444 KB Output is correct
42 Correct 27 ms 4548 KB Output is correct
43 Correct 26 ms 4444 KB Output is correct
44 Correct 28 ms 4444 KB Output is correct
45 Correct 28 ms 4440 KB Output is correct
46 Correct 30 ms 4444 KB Output is correct
47 Correct 43 ms 4444 KB Output is correct
48 Correct 35 ms 4444 KB Output is correct
49 Correct 27 ms 4444 KB Output is correct
50 Correct 27 ms 4440 KB Output is correct
51 Correct 34 ms 4444 KB Output is correct
52 Correct 27 ms 4444 KB Output is correct
53 Correct 27 ms 4440 KB Output is correct
54 Correct 43 ms 4444 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4640 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4548 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 2 ms 4440 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 28 ms 4548 KB Output is correct
35 Correct 46 ms 4444 KB Output is correct
36 Correct 41 ms 4524 KB Output is correct
37 Correct 26 ms 4444 KB Output is correct
38 Correct 26 ms 4444 KB Output is correct
39 Correct 26 ms 4444 KB Output is correct
40 Correct 26 ms 4544 KB Output is correct
41 Correct 26 ms 4696 KB Output is correct
42 Correct 26 ms 4440 KB Output is correct
43 Correct 33 ms 4540 KB Output is correct
44 Correct 26 ms 4524 KB Output is correct
45 Correct 29 ms 4696 KB Output is correct
46 Correct 28 ms 4440 KB Output is correct
47 Correct 27 ms 4444 KB Output is correct
48 Correct 29 ms 4444 KB Output is correct
49 Correct 29 ms 4444 KB Output is correct
50 Correct 27 ms 4444 KB Output is correct
51 Correct 26 ms 4444 KB Output is correct
52 Correct 31 ms 4540 KB Output is correct
53 Correct 27 ms 4444 KB Output is correct
54 Correct 28 ms 4444 KB Output is correct
55 Execution timed out 1094 ms 4444 KB Time limit exceeded
56 Halted 0 ms 0 KB -