oj.uz

Submission #366645

# Submission time Handle Problem Language Result Execution time Memory
366645 2021-02-14T20:15:02 Z Mamnoon_Siam Amusement Park (JOI17_amusement_park) C++17
10 / 100
 37 ms 9492 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

/* sorry, this is the bare minimum :'( */
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

const int N = 1e5 + 5;

namespace {
  int vis[N];
  int cnt = 0;
  int rnk[N];
  vi g[N];
  void dfs(int u) {
    vis[u] = 1;
    rnk[u] = cnt++;
    for(int v : g[u]) if(!vis[v]) {
      dfs(v);
    }
  }
}

void Joi(int n, int m, int A[], int B[], long long X, int T) {
  for(int i = 0; i < m; ++i) {
    g[A[i]].emplace_back(B[i]);
    g[B[i]].emplace_back(A[i]);
  }
  dfs(0);
  for(int i = 0; i < n; ++i) {
    MessageBoard(i, X >> (rnk[i] % 60) & 1);
  }
}

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

/* sorry, this is the bare minimum :'( */
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

const int N = 1e5 + 5;

namespace {
  vi g[N];
  int vis[N], rnk[N];
  int cnt = 0;
  vi tour;
  void dfs(int u) {
    vis[u] = 1;
    rnk[u] = cnt++;
    tour.emplace_back(u);
    for(int v : g[u]) if(!vis[v]) {
      dfs(v);
      tour.emplace_back(u);
    }
  }
}

long long Ioi(int n, int m, int A[], int B[], int P, int V, int T) {
  for(int i = 0; i < m; ++i) {
    g[A[i]].emplace_back(B[i]);
    g[B[i]].emplace_back(A[i]);
  }
  memset(vis, 0, sizeof vis);
  dfs(0);
  assert(sz(tour));
  tour.pop_back();
  ll ret = ll(V) << (rnk[P] % 60);
  int st = int(find(all(tour), P) - tour.begin());
  for(int _ = 0, i = (st+1) % sz(tour); _ < 120; i = (i+1) % sz(tour), ++_) {
    ret |= ll(Move(tour[i])) << (rnk[tour[i]] % 60);
  }
  return ret;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 9156 KB Output is correct
2 Correct 31 ms 9284 KB Output is correct
3 Correct 28 ms 9492 KB Output is correct
4 Correct 19 ms 7692 KB Output is correct
5 Incorrect 19 ms 8204 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5864 KB Output is correct
2 Correct 4 ms 5864 KB Output is correct
3 Correct 4 ms 5900 KB Output is correct
4 Correct 6 ms 6292 KB Output is correct
5 Correct 6 ms 6292 KB Output is correct
6 Correct 6 ms 6292 KB Output is correct
7 Correct 6 ms 6536 KB Output is correct
8 Correct 6 ms 6536 KB Output is correct
9 Correct 15 ms 8668 KB Output is correct
10 Correct 17 ms 8588 KB Output is correct
11 Correct 16 ms 8588 KB Output is correct
12 Correct 4 ms 5736 KB Output is correct
13 Correct 4 ms 5908 KB Output is correct
14 Correct 4 ms 5860 KB Output is correct
15 Correct 4 ms 5860 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9028 KB Output is correct
2 Incorrect 28 ms 8900 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 9108 KB Output is correct
2 Correct 37 ms 8900 KB Output is correct
3 Incorrect 31 ms 9072 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -