Submission #1119819

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119819		pera	Speedrun (RMI21_speedrun)	C++17	100 / 100	401 ms	1324 KiB

speedrun

#include<bits/stdc++.h>
#include "speedrun.h"
using namespace std;
void assignHints(int subtask , int N , int A[] , int B[]){
   vector<vector<int>> g(N + 1);
   for(int i = 1;i <= N - 1;i ++){
      g[A[i]].emplace_back(B[i]);
      g[B[i]].emplace_back(A[i]);
   }
   vector<int> par(N + 1) , o;
   function<void(int)> dfs = [&](int u){
      o.emplace_back(u);
      for(int v : g[u]){
         if(v != par[u]){
            par[v] = u;
            dfs(v);
         }
      }
   };
   dfs(1);
   setHintLen(20);
   for(int i = 1;i <= N;i ++){
      for(int bit = 0;bit < 10;bit ++){
         setHint(o[i - 1] , bit + 1, par[o[i - 1]] >> bit & 1);
      } 
      for(int bit = 0;bit < 10;bit ++){
         setHint(o[i - 1] , bit + 10 + 1 , o[i % N] >> bit & 1);
      }
   }
}
void speedrun(int subtask , int N , int v){
   int c = 0 , nxt = 0;
   vector<int> vis(N + 1);
   while(c < N){
      c += vis[v] == 0;
      vis[v] = 1;
      if(nxt == 0){
         for(int bit = 0;bit < 10;bit ++){
            nxt += (1 << bit) * getHint(bit + 10 + 1);
         }
      }
      assert(0 < nxt && nxt <= N);
      if(goTo(nxt) == true){
         v = nxt;
         nxt = 0;
      }else{
         int par = 0;
         for(int bit = 0;bit < 10;bit ++){
            par += (1 << bit) * getHint(bit + 1);
         }
         assert(0 < par && par <= N);
         goTo(par);
         v = par;
      }
   }
   return;
}

• Subtask 1: 21 / 21
• Subtask 2: 8 / 8
• Subtask 3: 19 / 19
• Subtask 4: 12 / 12
• Subtask 5: 40 / 40