oj.uz

답안 #842002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842002 2023-09-02T10:01:35 Z vjudge1 Speedrun (RMI21_speedrun) C++17
0 / 100
 3500 ms 4076 KB 
#include <bits/stdc++.h>
#include "speedrun.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];
                }
            }
        }
        for(int i = 1;i <= N;i ++) {
            if(used[i] == false) cout << -1;
        }
    }
    return;
}

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:84:26: warning: unused variable 'k' [-Wunused-variable]
   84 |                     bool k = goTo(i);
      |                          ^
speedrun.cpp:76:13: warning: unused variable 'l' [-Wunused-variable]
   76 |         int l = getLength(),pos = start,cnt = 1;
      |             ^

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3545 ms 4076 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB setHintLen was never called
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB setHintLen was never called
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB setHintLen was never called
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB setHintLen was never called
2 Halted 0 ms 0 KB -