oj.uz

답안 #536931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536931 2022-03-14T07:52:10 Z joelau Speedrun (RMI21_speedrun) C++14
8 / 100
 56 ms 728 KB 
#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;
 
void assignHints(int subtask, int N, int A[], int B[]) {
    int deg[N+5];
    memset(deg,0,sizeof(deg));
    for (int i = 1; i < N; ++i) deg[A[i]]++, deg[B[i]]++;
    int x = 1;
    for (int i = 1; i <= N; ++i) if (deg[i] > deg[x]) x = i;
    setHintLen(20);
    for (int i = 0; i < 20; ++i) for (int j = 1; j <= N; ++j) if (x & (1<<i)) setHint(j,i+1,1);
}
 
void speedrun(int subtask, int N, int start) {
    int len = getLength();
    bitset<1005> visited;
    visited[start] = 1;
    int x = 0;
    for (int i = 0; i < 20; ++i) if (getHint(i+1)) x |= (1<<i);
    if (start != x) goTo(x), visited[x] = 1;
    for (int i = 1; i <= N; ++i) if (!visited[i]) goTo(i), goTo(x);
}

Compilation message

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

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 600 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 724 KB Output is correct
2 Correct 38 ms 720 KB Output is correct

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 728 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 56 ms 684 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 676 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -