oj.uz

Submission #51566

# Submission time Handle Problem Language Result Execution time Memory
51566 2018-06-18T16:31:38 Z BrunoPloumhans Amusement Park (JOI17_amusement_park) C++14
10 / 100
 38 ms 5784 KB 
#include "Joi.h"

#include <bits/stdc++.h>
using namespace std;

#define int long long

struct UnionFind {
  vector<int> p, ranks;

  UnionFind(int n) : p(n), ranks(n, 0) {
    for(int i = 0; i < n; ++i) {
      p[i] = i;
    }
  }

  int find_set(int a) {
    return p[a] == a ? a : p[a] = find_set(p[a]);
  }

  bool is_same_set(int a, int b) {
    return find_set(a) == find_set(b);
  }

  void unite(int a, int b) {
    int x = find_set(a), y = find_set(b);
    if(x != y) {
      if(ranks[x] > ranks[y])
	p[y] = x;
      else {
	p[x] = y;
	if(ranks[x] == ranks[y]) {
	  ++ranks[y];
	}
      }
    }
  }
};

static vector<vector<int>> adj;
static int tim = 0;
static vector<int> ts;
static vector<int> path;

static void dfs(int u) {
  ts[u] = tim++;
  path.push_back(u);
  for(int v : adj[u]) {
    if(ts[v] == -1) {
      dfs(v);
      path.push_back(u);
    }
  }
}

static void find_tree(int n, int m, signed A[], signed B[]) {
  adj.resize(n);
  UnionFind uf(n);
  vector<pair<int, int>> edges(m);
  for(int i = 0; i < m; ++i) {
    edges[i] = {min(A[i], B[i]), max(A[i], B[i])};
  }
  sort(edges.begin(), edges.end());
  int k = 0;
  for(pair<int, int> p : edges) {
    int u = p.first, v = p.second;
    if(!uf.is_same_set(u, v)) {
      uf.unite(u, v);
      adj[u].push_back(v);
      adj[v].push_back(u);
      ++k;
    }
  }

  assert(k == n-1);

  ts.assign(n, -1);
  dfs(0);
  /*cout << "ts: { ";
  for(int i = 0; i < n; ++i) {
    cout << ts[i] << ", ";
  }
  cout << "}\n";
  cout << "path: { ";
  for(int i : path) {
    cout << i << ", ";
  }
  cout << "}" << endl;*/
}

void Joi(signed n, signed m, signed A[], signed B[], long long X, signed T) {
  int seq[60];
  //cout << "seq: { ";
  for(int i = 0; i < 60; ++i) {
    seq[i] = ((X&(1LL << i)) > 0);
    //cout << seq[i] << ", ";
  }
  //cout << "}" << endl;
  find_tree(n, m, A, B);
  for(int i = 0; i < n; ++i) {
    assert(ts[i] != -1);
    MessageBoard(i, seq[ts[i]%60]);
  }
}

#include "Ioi.h"

#include <bits/stdc++.h>
using namespace std;

#define int long long

struct UnionFind {
  vector<int> p, ranks;

  UnionFind(int n) : p(n), ranks(n, 0) {
    for(int i = 0; i < n; ++i) {
      p[i] = i;
    }
  }

  int find_set(int a) {
    return p[a] == a ? a : p[a] = find_set(p[a]);
  }

  bool is_same_set(int a, int b) {
    return find_set(a) == find_set(b);
  }

  void unite(int a, int b) {
    int x = find_set(a), y = find_set(b);
    if(x != y) {
      if(ranks[x] > ranks[y])
	p[y] = x;
      else {
	p[x] = y;
	if(ranks[x] == ranks[y]) {
	  ++ranks[y];
	}
      }
    }
  }
};

static vector<vector<int>> adj;
static int tim = 0;
static vector<int> ts;
static vector<int> path;

static void dfs(int u) {
  ts[u] = tim++;
  path.push_back(u);
  for(int v : adj[u]) {
    if(ts[v] == -1) {
      dfs(v);
      path.push_back(u);
    }
  }
}

static void find_tree(int n, int m, signed A[], signed B[]) {
  adj.resize(n);
  UnionFind uf(n);
  vector<pair<int, int>> edges(m);
  for(int i = 0; i < m; ++i) {
    edges[i] = {min(A[i], B[i]), max(A[i], B[i])};
  }
  sort(edges.begin(), edges.end());
  for(pair<int, int> p : edges) {
    int u = p.first, v = p.second;
    if(!uf.is_same_set(u, v)) {
      uf.unite(u, v);
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
  }

  ts.assign(n, -1);
  dfs(0);
}

long long Ioi(signed n, signed m, signed A[], signed B[], signed p, signed v, signed T) {
  find_tree(n, m, A, B);
  int seq[60];
  seq[ts[p]%60] = v;
  int i;
  for(i = 0; i < n; ++i) {
    if(path[i] == p) {
      break;
    }
  }
  for(int k = 0; k < 120; ++k) {
    i = (i+1)%(path.size()-1);
    int res = Move(path[i]);
    seq[ts[path[i]]%60] = res;
  }
  int X = 0;
  for(int j = 0; j < 60; ++j)
    X |= seq[j] << j;
  return X;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 608 KB Output is correct
2 Incorrect 6 ms 1000 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5224 KB Output is correct
2 Correct 38 ms 5576 KB Output is correct
3 Correct 35 ms 5576 KB Output is correct
4 Incorrect 25 ms 5576 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5576 KB Output is correct
2 Correct 4 ms 5576 KB Output is correct
3 Correct 4 ms 5576 KB Output is correct
4 Correct 7 ms 5576 KB Output is correct
5 Correct 8 ms 5576 KB Output is correct
6 Correct 6 ms 5576 KB Output is correct
7 Correct 8 ms 5576 KB Output is correct
8 Correct 7 ms 5576 KB Output is correct
9 Correct 26 ms 5588 KB Output is correct
10 Correct 22 ms 5692 KB Output is correct
11 Correct 19 ms 5784 KB Output is correct
12 Correct 6 ms 5784 KB Output is correct
13 Correct 5 ms 5784 KB Output is correct
14 Correct 4 ms 5784 KB Output is correct
15 Correct 4 ms 5784 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 5784 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 5784 KB Output is correct
2 Incorrect 37 ms 5784 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -