Submission #841987

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
841987	2023-09-02T09:45:28 Z	vjudge1	Speedrun (RMI21_speedrun)	C++17	Compilation error	0 ms	0 KB

speedrun

#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
 
// Defines
 
#define pb push_back // kak push_back 5
#define endl '\n'
#define FOR(i,start,end) for(int i = start;i < end;i ++)
#define REV(i,start,end) for(int i = start;i >= end;i --)
#define precal(x) fixed << setprecision(x)
#define F first
#define S second
#define sz(x) (ll)x.size()
#define all(x) (x).begin(),(x).end()
#define m_p make_pair
#define mt make_tuple
#define str to_string

// #ifndef ONLINE_JUDGE
//     #define cerr if(false) cerr
// #endif
 

int k[1001][1001];

// void setHintLen(int l){

// }

// void setHint(int i, int j, bool b){

// }

// int getLength(){

// }

// bool getHint(int j){

// }

// bool goTo(int x){
    
// }

void assignHints(int subtask, int N, int A [], int B []){
    if(subtask == 1){
        setHintLen(N);
        for(int i = 1;i <= N - 1;i ++){
            k[A[i]][B[i]] = 1,k[B[i]][A[i]] = 1;
        }
        for(int i = 1;i <= N;i ++){
            for(int j = 1;j <= N;j ++){
                if(i == j) continue;
                setHint(i,j,bool(k[i][j]));
            }
        }
    }
    return;
}

void speedrun(int subtask, int N, int start ){
    if(subtask == 1){
        bool used[N + 1],pr[N + 1];
        used[start] = true,pr[start] = start;
        int l = getLength(),pos = start,cnt = 1;
        while(cnt != N){
            used[pos] = true;
            for(int i = 1;i <= N;i ++){
                if(used[i] == true) continue;
                bool f = getHint(i);
                if(f == true){
                    pr[i] = pos;
                    bool k = goTo(i);
                    pos = i;
                    cnt ++;
                    break;
                }
                if(i == N){
                    goTo(pr[pos]);
                    pos = pr[pos];
                }
            }
        }
    }
    return;
}

Compilation message

speedrun.cpp: In function 'void assignHints(int, int, int*, int*)':
speedrun.cpp:57:9: error: 'setHintLen' was not declared in this scope
   57 |         setHintLen(N);
      |         ^~~~~~~~~~
speedrun.cpp:64:17: error: 'setHint' was not declared in this scope; did you mean 'setns'?
   64 |                 setHint(i,j,bool(k[i][j]));
      |                 ^~~~~~~
      |                 setns
speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:75:17: error: 'getLength' was not declared in this scope
   75 |         int l = getLength(),pos = start,cnt = 1;
      |                 ^~~~~~~~~
speedrun.cpp:76:15: error: 'cnt' was not declared in this scope; did you mean 'int'?
   76 |         while(cnt != N){
      |               ^~~
      |               int
speedrun.cpp:77:18: error: 'pos' was not declared in this scope; did you mean 'pow'?
   77 |             used[pos] = true;
      |                  ^~~
      |                  pow
speedrun.cpp:80:26: error: 'getHint' was not declared in this scope; did you mean 'getline'?
   80 |                 bool f = getHint(i);
      |                          ^~~~~~~
      |                          getline
speedrun.cpp:83:30: error: 'goTo' was not declared in this scope
   83 |                     bool k = goTo(i);
      |                              ^~~~
speedrun.cpp:83:26: warning: unused variable 'k' [-Wunused-variable]
   83 |                     bool k = goTo(i);
      |                          ^
speedrun.cpp:89:21: error: 'goTo' was not declared in this scope
   89 |                     goTo(pr[pos]);
      |                     ^~~~
speedrun.cpp:75:13: warning: unused variable 'l' [-Wunused-variable]
   75 |         int l = getLength(),pos = start,cnt = 1;
      |             ^