oj.uz

답안 #498839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498839 2021-12-26T12:44:12 Z SlavicG Speedrun (RMI21_speedrun) C++17
0 / 100
 953 ms 660 KB 
#include "speedrun.h"
#include "bits/stdc++.h"
using namespace std;
 
#define pb push_back
#define sz(a) (int)a.size()
 
/*
void setHintLen (int l){}
void setHint(int i, int j, bool b){}
int getLength(){}
bool getHint(int j){}
bool goTo(int x){}
*/
 
vector<int> st;
void dfsHint(int u, int par, vector<vector<int>>& adj, vector<int>& parent){
    st.pb(u);
    parent[u] = par;
    for(int v: adj[u]){
        if(v == par)continue;
        dfsHint(v, u, adj, parent);
    }
}
void assignHints(int subtask , int n, int a[], int b[]){
    setHintLen(30);
 
    vector<vector<int>> adj(n + 1);
    for(int i = 1;i <= n - 1; ++i){
        adj[a[i]].pb(b[i]);
        adj[b[i]].pb(a[i]);
    }  
    vector<int> right_neighbor(n + 1, 0), parent(n + 1, 0), left_child(n + 1, 0);
    dfsHint(1, 0, adj, parent);
    
    vector<int> nxt(n + 1, 0);
    for(int i = 0;i < sz(st); ++i){
        nxt[st[i]] = st[(i + 1) % sz(st)];
    }

    for(int i = 1;i <= n; ++i){
        int idx = 1;
        for(int j = 9;j >= 0; --j){
            if(parent[i] & (1 << j))setHint(i, idx, 1);
            ++idx;
        }
        for(int j = 9;j >= 0; --j){
            if(nxt[i] & (1 << j))setHint(i, idx, 1);
            ++idx;
        }
    }
}

int cnt;
void dfs(int u, vector<bool>& vis){
    if(!vis[u])--cnt;
    vis[u] = true;
    if(!cnt)exit(0);
    int par = 0, nxt = 0, idx = 1;
 
    for(int j = 9;j >= 0; --j){
        if(getHint(idx))par += (1 << j);
        ++idx;
    }
    for(int j = 9;j >= 0; --j){
        if(getHint(idx))nxt += (1 << j);
        ++idx;
    }

    bool x = goTo(nxt);
    if(x)dfs(nxt, vis);
    else{
        goTo(par);
        dfs(par, vis);
    }

}
void speedrun(int subtask, int n, int start){
    int l = getLength();
    vector<bool> vis(n + 1, false);
    cnt = n;
    dfs(start, vis);
}
 
/*
int main(){
 
}
*/

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:79:9: warning: unused variable 'l' [-Wunused-variable]
   79 |     int l = getLength();
      |         ^

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 135 ms 548 KB Used too many wrong interactions
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 953 ms 660 KB Used too many wrong interactions
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 136 ms 660 KB Used too many wrong interactions
2 Halted 0 ms 0 KB -