oj.uz

Submission #910855

# Submission time Handle Problem Language Result Execution time Memory
910855 2024-01-18T08:31:33 Z dragusanu_rares Speedrun (RMI21_speedrun) C++14
100 / 100
 98 ms 1848 KB 
#include <bits/stdc++.h>
#include "speedrun.h"
using namespace std;
vector<vector<int>> adj;
int visited[1005];
int parent[1005];
int nxt[1005];
int n,ult_nod=1;
void hint(int nod){
    int poz=1;
    while(parent[nod]>0){
        setHint(nod, poz, parent[nod]&1);
        parent[nod]/=2;
        poz++;
    }
    poz=11;
    while(nxt[nod]>0){
        setHint(nod, poz, nxt[nod]&1);
        nxt[nod]>>=1;
        poz++;
    }
    return;
}
void dfs(int nod){
    for(int i=0;i<adj[nod].size();i++){
        if(!visited[adj[nod][i]]){
            visited[adj[nod][i]]=1;
            nxt[ult_nod]=adj[nod][i];
            ult_nod=adj[nod][i];
            parent[adj[nod][i]]=nod;
            dfs(adj[nod][i]);
        }
    }
    return;
}
void assignHints (int subtask , int N, int a[], int b[]){
    n=N;
    setHintLen(20);
    adj.resize(n+5);
    for(int i=1;i<n;i++){
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }
    ult_nod=1;
    visited[1]=1;
    dfs(1);
    nxt[ult_nod]=0;
    for(int i=1;i<=n;i++){
        hint(i);
    }
    return;
}
void speedrun(int subtask , int N, int nod ){
    int nr;
    while(nod!=1){
        nr=0;
        for(int i=10;i>=1;i--){
            nr=nr*2+getHint(i);
        }
        nod=nr;
        goTo(nr);
    }
    int nxt=1;
    while(1){
        if(nxt==nod){
            nr=0;
            for(int j=20;j>=11;j--){
                nr=nr*2+getHint(j);
            }
            nxt=nr;
            if(nxt==0)return;
        }
        if(goTo(nxt)){
            nod=nxt;
        }
        else{
            nr=0;
            for(int j=10;j>=1;j--){
                nr=nr*2+getHint(j);
            }
            nod=nr;
            goTo(nr);
        }
    }
    return;
}

Compilation message

speedrun.cpp: In function 'void dfs(int)':
speedrun.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i=0;i<adj[nod].size();i++){
      |                 ~^~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1732 KB Output is correct
2 Correct 84 ms 1228 KB Output is correct
3 Correct 81 ms 1340 KB Output is correct
4 Correct 93 ms 1348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 1592 KB Output is correct
2 Correct 79 ms 1480 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1084 KB Output is correct
2 Correct 91 ms 1740 KB Output is correct
3 Correct 91 ms 1848 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1724 KB Output is correct
2 Correct 88 ms 1588 KB Output is correct
3 Correct 91 ms 1360 KB Output is correct
4 Correct 88 ms 1492 KB Output is correct
5 Correct 97 ms 1592 KB Output is correct
6 Correct 77 ms 1600 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 1224 KB Output is correct
2 Correct 98 ms 1228 KB Output is correct
3 Correct 96 ms 1604 KB Output is correct
4 Correct 82 ms 1340 KB Output is correct
5 Correct 85 ms 1472 KB Output is correct
6 Correct 94 ms 1596 KB Output is correct
7 Correct 83 ms 1236 KB Output is correct