oj.uz

Submission #699895

# Submission time Handle Problem Language Result Execution time Memory
699895 2023-02-18T08:11:31 Z cig32 Amusement Park (JOI17_amusement_park) C++17
75 / 100
 26 ms 4468 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] = 0;
  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];
  
  int cntmv = 0;
  while(sz[node] < 60) {
    node = p[node];
    idx = l[node];
    res[val[node]] = Move(node);
    cntmv++;
  }

  for(int i=0; i<180-cntmv; i++) {
    idx++;
    if(idx == et.size()) break;
    node = et[idx];
    res[val[node]] = Move(node);
  }

  

  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:66:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     if(idx == et.size()) break;
      |        ~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 2 ms 1152 KB Output is correct
3 Correct 2 ms 1292 KB Output is correct
4 Correct 2 ms 1160 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1156 KB Output is correct
7 Correct 1 ms 1288 KB Output is correct
8 Correct 2 ms 1288 KB Output is correct
9 Correct 2 ms 1288 KB Output is correct
10 Correct 1 ms 1160 KB Output is correct
11 Correct 6 ms 1484 KB Output is correct
12 Correct 1 ms 1164 KB Output is correct
13 Correct 2 ms 1288 KB Output is correct
14 Correct 2 ms 1288 KB Output is correct
15 Correct 2 ms 1288 KB Output is correct
16 Correct 2 ms 1296 KB Output is correct
17 Correct 1 ms 1288 KB Output is correct
18 Correct 2 ms 1308 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4224 KB Output is correct
2 Correct 24 ms 4468 KB Output is correct
3 Correct 22 ms 4420 KB Output is correct
4 Correct 12 ms 2864 KB Output is correct
5 Correct 13 ms 3536 KB Output is correct
6 Correct 13 ms 3352 KB Output is correct
7 Correct 13 ms 3276 KB Output is correct
8 Correct 12 ms 3396 KB Output is correct
9 Correct 13 ms 3416 KB Output is correct
10 Correct 16 ms 3152 KB Output is correct
11 Correct 12 ms 2920 KB Output is correct
12 Correct 11 ms 2868 KB Output is correct
13 Correct 11 ms 2876 KB Output is correct
14 Correct 11 ms 2876 KB Output is correct
15 Correct 13 ms 2856 KB Output is correct
16 Correct 12 ms 2860 KB Output is correct
17 Correct 16 ms 2836 KB Output is correct
18 Correct 15 ms 2884 KB Output is correct
19 Correct 12 ms 2892 KB Output is correct
20 Correct 9 ms 3504 KB Output is correct
21 Correct 10 ms 3532 KB Output is correct
22 Correct 12 ms 3120 KB Output is correct
23 Correct 12 ms 3384 KB Output is correct
24 Correct 12 ms 3232 KB Output is correct
25 Correct 13 ms 3308 KB Output is correct
26 Correct 12 ms 3332 KB Output is correct
27 Correct 12 ms 3400 KB Output is correct
28 Correct 15 ms 3448 KB Output is correct
29 Correct 12 ms 3192 KB Output is correct
30 Correct 12 ms 3332 KB Output is correct
31 Correct 1 ms 1152 KB Output is correct
32 Correct 2 ms 1072 KB Output is correct
33 Correct 1 ms 1284 KB Output is correct
34 Correct 1 ms 1160 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 1 ms 1160 KB Output is correct
37 Correct 2 ms 1156 KB Output is correct
38 Correct 2 ms 1160 KB Output is correct
39 Correct 2 ms 1160 KB Output is correct
40 Correct 1 ms 1152 KB Output is correct
41 Correct 1 ms 1164 KB Output is correct
42 Correct 2 ms 1180 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1160 KB Output is correct
2 Correct 2 ms 1164 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 3 ms 1564 KB Output is correct
5 Correct 2 ms 1564 KB Output is correct
6 Correct 3 ms 1604 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 2 ms 1564 KB Output is correct
9 Correct 10 ms 4056 KB Output is correct
10 Correct 10 ms 4132 KB Output is correct
11 Correct 10 ms 4176 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1156 KB Output is correct
14 Correct 1 ms 1156 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct

Subtask #4
47.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 4420 KB Partially correct
2 Partially correct 20 ms 4324 KB Partially correct
3 Partially correct 22 ms 4304 KB Partially correct
4 Partially correct 13 ms 2956 KB Partially correct
5 Partially correct 13 ms 3780 KB Partially correct
6 Partially correct 12 ms 3392 KB Partially correct
7 Partially correct 12 ms 3404 KB Partially correct
8 Partially correct 13 ms 3140 KB Partially correct
9 Partially correct 12 ms 3284 KB Partially correct
10 Partially correct 11 ms 2876 KB Partially correct
11 Partially correct 12 ms 3012 KB Partially correct
12 Partially correct 11 ms 2788 KB Partially correct
13 Partially correct 12 ms 2840 KB Partially correct
14 Partially correct 13 ms 2940 KB Partially correct
15 Partially correct 16 ms 2980 KB Partially correct
16 Partially correct 12 ms 2892 KB Partially correct
17 Partially correct 13 ms 2888 KB Partially correct
18 Partially correct 12 ms 2884 KB Partially correct
19 Partially correct 13 ms 2900 KB Partially correct
20 Partially correct 10 ms 3536 KB Partially correct
21 Partially correct 10 ms 3524 KB Partially correct
22 Partially correct 13 ms 3316 KB Partially correct
23 Partially correct 16 ms 3288 KB Partially correct
24 Partially correct 15 ms 3272 KB Partially correct
25 Partially correct 12 ms 3420 KB Partially correct
26 Partially correct 13 ms 3276 KB Partially correct
27 Partially correct 12 ms 3568 KB Partially correct
28 Partially correct 13 ms 3144 KB Partially correct
29 Partially correct 11 ms 3132 KB Partially correct
30 Partially correct 12 ms 3264 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 4292 KB Output isn't correct
2 Halted 0 ms 0 KB -