oj.uz

Submission #700029

# Submission time Handle Problem Language Result Execution time Memory
700029 2023-02-18T14:07:05 Z cig32 Amusement Park (JOI17_amusement_park) C++17
0 / 100
 25 ms 4792 KB 
#include "Joi.h"
#include "bits/stdc++.h"
using namespace std;

static vector<int> adj2[12269];
static bool vis2[12269];
static int val2[12269];
static int nxt2;
static void dfs2(int node, long long X, int par) {
  val2[node] = nxt2;
  nxt2 = (nxt2 + 1) % 60;
  long long res = (X & (1ll << val2[node]));
  if(res > 0) res = 1;
  MessageBoard(node, (int) res);
  vis2[node] = 1;
  for(int x: adj2[node]) {
    if(!vis2[x]) {
      dfs2(x, X, node);
    }
  }
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
  for(int i=0; i<M; i++) {
    adj2[A[i]].push_back(B[i]);
    adj2[B[i]].push_back(A[i]);
  }
  for(int i=0; i<N; i++) {
    sort(adj2[i].begin(), adj2[i].end());
  }
  for(int i=0; i<N; i++) {
    vis2[i] = 0;
  }
  dfs2(0, X, -1);
}

#include "Ioi.h"
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e4 + 10;
static vector<int> adj[MAXN];
static bool vis[MAXN];
static int val[MAXN];
static int sz[MAXN];
static int nxt;
static vector<int> et;
static int p[MAXN];
static void dfs(int node, int par) {
  val[node] = nxt;
  nxt = (nxt+1) % 60;
  vis[node] = 1;
  sz[node] = 1;
  p[node] = par;
  et.push_back(node);
  for(int x: adj[node]) {
    if(!vis[x]) {
      dfs(x, node);
      et.push_back(node);
      sz[node] += sz[x];
    }
  }
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  nxt = 0;
  et.clear();
  for(int i=0; i<N; i++) {
    adj[i].clear();
  }
  for(int i=0; i<M; i++) {
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }
  for(int i=0; i<N; i++) {
    sort(adj[i].begin(), adj[i].end());
  }
  for(int i=0; i<N; i++) {
    vis[i] = 0;
  }
  dfs(0, -1);
  long long ans = 0;
  int res[60];
  for(int i=0; i<60; i++) res[i] = -1;
  res[val[P]] = V;
  int l[N];
  for(int i=0; i<N; i++) l[i] = -1;
  for(int i=0; i<et.size(); i++) {
    if(l[et[i]] == -1) l[et[i]] = i;
  }
  int node = P, idx = l[P];
  et.pop_back();
  
  set<int> visited;
  int mvc=0;
  do {
    node = p[node];
    idx = l[node];
    int pre;
    for(int i=idx; i<idx+2*(sz[node]-1); i++) {
      int nd = et[i];
      if(visited.count(nd)) {
        i += 2*sz[nd]-1;
        continue;//1->2->3->4->3->2->1->5->1
      }
      res[val[nd]] = Move(nd);
      pre=nd;
      mvc++;
      if(mvc==120)break;
    }
    if(mvc==120)break;
    if(pre!=node) {
      res[val[node]]=Move(node);
      mvc++;
      if(mvc==120)break;
    }
    visited.insert(node);
  } while(sz[node] < 60);

  for(int i=0; i<60; i++) {
    if(res[i]) ans += (1ll << i);
  }
  return ans;
}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:51:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i=0; i<et.size(); i++) {
      |                ~^~~~~~~~~~
Ioi.cpp:75:5: warning: 'pre' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     if(pre!=node) {
      |     ^~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4356 KB Output is correct
2 Correct 22 ms 4500 KB Output is correct
3 Incorrect 22 ms 4516 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1160 KB Output is correct
2 Correct 1 ms 1164 KB Output is correct
3 Correct 1 ms 1164 KB Output is correct
4 Incorrect 2 ms 1580 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4324 KB Output is correct
2 Correct 20 ms 4792 KB Output is correct
3 Correct 25 ms 4700 KB Output is correct
4 Correct 13 ms 3096 KB Output is correct
5 Correct 12 ms 3880 KB Output is correct
6 Correct 12 ms 3484 KB Output is correct
7 Correct 12 ms 3568 KB Output is correct
8 Correct 14 ms 3380 KB Output is correct
9 Correct 13 ms 3216 KB Output is correct
10 Correct 12 ms 3128 KB Output is correct
11 Correct 13 ms 3120 KB Output is correct
12 Correct 11 ms 2948 KB Output is correct
13 Correct 12 ms 2964 KB Output is correct
14 Correct 13 ms 3088 KB Output is correct
15 Incorrect 13 ms 3096 KB Wrong Answer [7]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4296 KB Output is correct
2 Correct 20 ms 4784 KB Output is correct
3 Correct 22 ms 4732 KB Output is correct
4 Correct 12 ms 3112 KB Output is correct
5 Correct 13 ms 4132 KB Output is correct
6 Correct 15 ms 3496 KB Output is correct
7 Correct 13 ms 3352 KB Output is correct
8 Correct 12 ms 3524 KB Output is correct
9 Correct 13 ms 3488 KB Output is correct
10 Correct 13 ms 3104 KB Output is correct
11 Correct 14 ms 3112 KB Output is correct
12 Correct 11 ms 2956 KB Output is correct
13 Correct 11 ms 2956 KB Output is correct
14 Correct 11 ms 3092 KB Output is correct
15 Correct 11 ms 3040 KB Output is correct
16 Correct 11 ms 3100 KB Output is correct
17 Correct 13 ms 3116 KB Output is correct
18 Correct 13 ms 3092 KB Output is correct
19 Correct 13 ms 3080 KB Output is correct
20 Correct 10 ms 3752 KB Output is correct
21 Correct 10 ms 3752 KB Output is correct
22 Correct 13 ms 3500 KB Output is correct
23 Correct 12 ms 3472 KB Output is correct
24 Correct 13 ms 3476 KB Output is correct
25 Correct 13 ms 3592 KB Output is correct
26 Correct 13 ms 3412 KB Output is correct
27 Correct 13 ms 3752 KB Output is correct
28 Correct 13 ms 3724 KB Output is correct
29 Correct 11 ms 3476 KB Output is correct
30 Correct 13 ms 3500 KB Output is correct
31 Incorrect 2 ms 1176 KB Wrong Answer [7]
32 Halted 0 ms 0 KB -