oj.uz

Submission #730338

# Submission time Handle Problem Language Result Execution time Memory
730338 2023-04-25T17:41:19 Z Andrei_Calota Speedrun (RMI21_speedrun) C++14
100 / 100
 136 ms 884 KB 
#include <bits/stdc++.h>
#include<speedrun.h>

using namespace std;

const int NMAX = 1e3;
const int BITS = 20, HALF = 10;
const int ROOT = 1, NONE = 0;

int par[1 + NMAX];
vector<int> tree[1 + NMAX];
int lastNode; int nextPreoder[1 + NMAX];

void DFSassign (int root, int p) {
    par[root] = p;
    nextPreoder[lastNode] = root; lastNode = root;
    for (int node : tree[root])
       if (node != p)
          DFSassign (node, root);
}

/**bool bits[50][20];
void setHint (int node, int bit, bool value) {
   bits[node][bit] = value;
}
bool getHint (int node, int bit) {
   return bits[node][bit];
}**/

void assignHints (int substask, int N, int A[], int B[]) {
   setHintLen (BITS);
   for (int i = 1; i < N; i ++) {
      tree[A[i]].push_back (B[i]);
      tree[B[i]].push_back (A[i]);
   }
   DFSassign (ROOT, NONE);
   for (int node = 1; node <= N; node ++)
      for (int bit = 0; bit < HALF; bit ++)
         if (par[node] & (1 << bit))
           setHint (node, bit + 1, true);

   for (int node = 1; node <= N; node ++)
      for (int bit = HALF; bit < BITS; bit ++)
         if (nextPreoder[node] & (1 << (bit - HALF)))
           setHint (node, bit + 1, true);
}



int getPar () {
   int p = 0;
   for (int bit = 0; bit < HALF; bit ++)
      if (getHint (bit + 1) == true)
        p = p + (1 << bit);
    return p;
}
int getNextPreoder () {
   int preord = 0;
   for (int bit = HALF; bit < BITS; bit ++)
      if (getHint (bit + 1) == true)
        preord = preord + (1 << (bit - HALF));
   return preord;
}

void speedrun (int subtask, int N, int start) {
   getLength ();

   while (getPar () > 0)
      goTo (getPar ());


   while (getNextPreoder () != NONE) {
      int target = getNextPreoder ();
      while (!goTo (target))
         goTo (getPar ());
   }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 720 KB Output is correct
2 Correct 93 ms 720 KB Output is correct
3 Correct 122 ms 672 KB Output is correct
4 Correct 124 ms 672 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 672 KB Output is correct
2 Correct 119 ms 768 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 684 KB Output is correct
2 Correct 107 ms 832 KB Output is correct
3 Correct 78 ms 744 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 884 KB Output is correct
2 Correct 93 ms 788 KB Output is correct
3 Correct 136 ms 712 KB Output is correct
4 Correct 129 ms 712 KB Output is correct
5 Correct 127 ms 708 KB Output is correct
6 Correct 110 ms 724 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 672 KB Output is correct
2 Correct 111 ms 720 KB Output is correct
3 Correct 98 ms 732 KB Output is correct
4 Correct 103 ms 716 KB Output is correct
5 Correct 118 ms 724 KB Output is correct
6 Correct 111 ms 672 KB Output is correct
7 Correct 92 ms 712 KB Output is correct