답안 #639815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639815 2022-09-11T18:31:18 Z DragonO_o Speedrun (RMI21_speedrun) C++17
100 / 100
211 ms 804 KB
#include "speedrun.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn=1e3+5;

vector<int>adj[maxn];
vector<int>ord;
int p[maxn];

void dfs(int v,int pr){
    p[v]=pr;
    ord.push_back(v);
    for(int to:adj[v]){
        if(to!=pr){
            dfs(to,v);
        }
    }
}

void assignHints(int subtask,int N,int A[],int B[]){
    setHintLen(20);
    for(int i=1;i<N;++i){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    dfs(1,-1);
    for(int i=1;i<=N;++i){
        int cur=ord[i-1];
        int nxt=ord[i%N];
        for(int bit=0;bit<10;++bit){
            setHint(cur,bit+1,nxt&(1<<bit));
            setHint(cur,bit+11,p[cur]&(1<<bit));
        }
    }
}

void speedrun(int subtask,int N,int start){
    int vis=0;
    while(vis++<N){
        int nxt=0;
        for(int bit=0;bit<10;++bit){
            nxt|=(getHint(bit+1)<<bit);
        }
        while(!goTo(nxt)){
            int pr=0;
            for(int bit=0;bit<10;++bit){
                pr|=(getHint(bit+11)<<bit);
            }
            goTo(pr);
        }
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 672 KB Output is correct
2 Correct 196 ms 672 KB Output is correct
3 Correct 201 ms 672 KB Output is correct
4 Correct 190 ms 708 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 676 KB Output is correct
2 Correct 197 ms 672 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 804 KB Output is correct
2 Correct 182 ms 672 KB Output is correct
3 Correct 187 ms 696 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 672 KB Output is correct
2 Correct 196 ms 684 KB Output is correct
3 Correct 200 ms 800 KB Output is correct
4 Correct 176 ms 672 KB Output is correct
5 Correct 190 ms 784 KB Output is correct
6 Correct 197 ms 704 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 672 KB Output is correct
2 Correct 195 ms 680 KB Output is correct
3 Correct 198 ms 740 KB Output is correct
4 Correct 206 ms 676 KB Output is correct
5 Correct 211 ms 736 KB Output is correct
6 Correct 199 ms 760 KB Output is correct
7 Correct 189 ms 672 KB Output is correct