Submission #504854

#	Time	Username	Problem	Language	Result	Execution time	Memory
504854		NhatMinh0208	Speedrun (RMI21_speedrun)	C++14	100 / 100	252 ms	928 KiB

speedrun

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
 
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}
 
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
 
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
#include "speedrun.h"
vector<ll> gt[1001],vec;
ll par[1001],nxt[1001];
ll i,j,k,t,u,v,a,b,n;
void dfs(int x, int p) {
  vec.push_back(x);
	par[x]=p;
  for (auto g : gt[x]) if (g-p) dfs(g,x);
}
void assignHints (int subtask , int N, int A[], int B[]) {
  if (subtask==1) {
    setHintLen(N);
    for (i=1;i<N;i++) {
      setHint(A[i],B[i],1);
      setHint(B[i],A[i],1);
    }
  }
  else {
    for (i=1;i<N;i++) {
      gt[A[i]].push_back(B[i]);
      gt[B[i]].push_back(A[i]);
    }
  	dfs(1,0);
  	for (i=1;i<N;i++) nxt[vec[i-1]]=(vec[i]);
    nxt[vec[N-1]]=0;
    setHintLen(20);
    for (i=1;i<=N;i++) {
      for (j=0;j<10;j++) setHint(i,j+1,(par[i]&(1<<j))>>j);
      for (j=0;j<10;j++) setHint(i,j+11,(nxt[i]&(1<<j))>>j);
    }
  }
}
void dfs2(int x, int p) {
	for (int g=1;g<=n;g++) if (getHint(g)) gt[x].push_back(g);
  	for (auto g : gt[x]) if (g-p) {
      goTo(g);
      dfs2(g,x);
    }
  	if (p) goTo(p);
}
void speedrun(int subtask , int N, int start ){
  n=N;
  	if (subtask==1) {
      dfs2(start,0);
    }
 	else {
      u=start;
      while(u!=1) {
        par[u]=0;
      	for (j=0;j<10;j++) {
          v=getHint(j+1);
          par[u]^=v<<j;
        }
       	goTo(par[u]);
        u=par[u];
      }
      while(true) {
        nxt[u]=0;
      	for (j=0;j<10;j++) {
          v=getHint(j+11);
          nxt[u]^=v<<j;
        }
        if (nxt[u]==0) break;
        a=nxt[u];
        while(true) {
          v=goTo(a);
          if (v==0) {
       		par[u]=0;
            for (j=0;j<10;j++) {
              v=getHint(j+1);
              par[u]^=v<<j;
            }
            goTo(par[u]);
            u=par[u];
          }
          else {
            u=a;
            break;
          }
        }
      }
    }
}
 

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