oj.uz

Submission #699881

# Submission time Handle Problem Language Result Execution time Memory
699881 2023-02-18T07:46:29 Z cig32 Amusement Park (JOI17_amusement_park) C++17
18 / 100
 25 ms 4316 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 nxt;
static vector<int> et;
static void dfs(int node, int par) {
  val[node] = nxt;
  nxt = (nxt+1) % 60;
  vis[node] = 1;
  et.push_back(node);
  for(int x: adj[node]) {
    if(!vis[x]) {
      dfs(x, node);
      et.push_back(node);
    }
  }
}

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];
  for(int i=val[P]-1; i>=0; i--) {
    while(idx-1 >= 0 && val[et[idx]] != i) {
      idx--;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  for(int i=1; i<60; i++) {
    while(idx+1 < et.size() && val[et[idx]] != i) {
      idx++;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  for(int i=1; i<60; i++) {
    while(idx-1 >= 0 && val[et[idx]] != i) {
      idx--;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  for(int i=59; i>0; i--) {
    while(idx+1 < et.size() && val[et[idx]] != i) {
      idx++;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  for(int i=59; i>0; i--) {
    while(idx-1 >= 0 && val[et[idx]] != i) {
      idx--;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  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:46:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   for(int i=0; i<et.size(); i++) {
      |                ~^~~~~~~~~~
Ioi.cpp:59:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     while(idx+1 < et.size() && val[et[idx]] != i) {
      |           ~~~~~~^~~~~~~~~~~
Ioi.cpp:75:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while(idx+1 < et.size() && val[et[idx]] != i) {
      |           ~~~~~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1152 KB Output is correct
2 Correct 0 ms 1160 KB Output is correct
3 Correct 2 ms 1168 KB Output is correct
4 Correct 2 ms 1168 KB Output is correct
5 Correct 2 ms 1164 KB Output is correct
6 Correct 1 ms 1156 KB Output is correct
7 Correct 2 ms 1160 KB Output is correct
8 Correct 1 ms 1168 KB Output is correct
9 Correct 2 ms 1168 KB Output is correct
10 Correct 1 ms 1164 KB Output is correct
11 Correct 4 ms 1488 KB Output is correct
12 Correct 2 ms 1160 KB Output is correct
13 Correct 2 ms 1168 KB Output is correct
14 Correct 2 ms 1464 KB Output is correct
15 Correct 2 ms 1168 KB Output is correct
16 Correct 2 ms 1160 KB Output is correct
17 Correct 2 ms 1168 KB Output is correct
18 Correct 2 ms 1176 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4172 KB Output is correct
2 Correct 20 ms 4172 KB Output is correct
3 Correct 23 ms 4316 KB Output is correct
4 Correct 13 ms 2896 KB Output is correct
5 Correct 13 ms 3268 KB Output is correct
6 Correct 12 ms 3152 KB Output is correct
7 Correct 13 ms 3140 KB Output is correct
8 Correct 12 ms 3272 KB Output is correct
9 Correct 12 ms 3260 KB Output is correct
10 Correct 11 ms 2924 KB Output is correct
11 Correct 13 ms 3020 KB Output is correct
12 Correct 11 ms 2740 KB Output is correct
13 Correct 11 ms 2736 KB Output is correct
14 Correct 11 ms 2756 KB Output is correct
15 Correct 13 ms 2760 KB Output is correct
16 Correct 12 ms 2756 KB Output is correct
17 Correct 12 ms 2872 KB Output is correct
18 Correct 13 ms 2892 KB Output is correct
19 Correct 13 ms 2888 KB Output is correct
20 Correct 11 ms 3404 KB Output is correct
21 Correct 11 ms 3556 KB Output is correct
22 Correct 13 ms 3092 KB Output is correct
23 Correct 13 ms 3356 KB Output is correct
24 Correct 12 ms 3376 KB Output is correct
25 Correct 13 ms 3356 KB Output is correct
26 Correct 13 ms 3392 KB Output is correct
27 Correct 13 ms 3380 KB Output is correct
28 Correct 13 ms 3368 KB Output is correct
29 Correct 12 ms 3108 KB Output is correct
30 Correct 12 ms 3352 KB Output is correct
31 Correct 1 ms 1160 KB Output is correct
32 Correct 2 ms 1164 KB Output is correct
33 Correct 2 ms 1160 KB Output is correct
34 Correct 1 ms 1164 KB Output is correct
35 Correct 2 ms 1156 KB Output is correct
36 Correct 2 ms 1164 KB Output is correct
37 Correct 1 ms 1160 KB Output is correct
38 Correct 2 ms 1164 KB Output is correct
39 Correct 1 ms 1156 KB Output is correct
40 Correct 2 ms 1176 KB Output is correct
41 Correct 1 ms 1164 KB Output is correct
42 Correct 1 ms 1164 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0.0 / 55.0

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

Subtask #5
0 / 17.0

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