제출 #737259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
737259		mjhmjh1104	Speedrun (RMI21_speedrun)	C++17	100 / 100	249 ms	1004 KiB

speedrun

#include "speedrun.h"
#include <cstdio>
#include <vector>
using namespace std;
 
int n;
vector<int> adj[1006], lt;
bool visited[1006];
 
void assign(int x, int y, int z) {
    for (int i = 0; i < 10; i++) setHint(x + 1, y * 10 + i + 1, z & 1 << i ? true : false);
}
 
int get(int y) {
    int ret = 0;
    for (int i = 0; i < 10; i++) ret |= getHint(y * 10 + i + 1) << i;
    return ret;
}
 
void _dfs(int x, int prev = -1) {
    if (prev == -1) assign(x, 0, 1023);
    else assign(x, 0, prev);
    lt.push_back(x);
    for (auto &i: adj[x]) if (i != prev) _dfs(i, x);
}
 
void assignHints(int subtask, int n, int a[], int b[]) {
    ::n = n;
    for (int i = 1; i < n; i++) {
        adj[a[i] - 1].push_back(b[i] - 1);
        adj[b[i] - 1].push_back(a[i] - 1);
    }
    setHintLen(20);
    _dfs(0);
    for (int i = 0; i < (int)lt.size(); i++) assign(lt[i], 1, lt[(i + 1) % (int)lt.size()]);
}

bool notVisited() {
    for (int i = 0; i < n; i++) if (!visited[i]) return true;
    return false;
}

bool move(int x) {
    if (x == 1023) return false;
    bool ret;
    if (ret = goTo(x + 1)) visited[x] = true;
    return ret;
}
 
void speedrun(int subtask, int n, int st) {
    ::n = n;
    st--;
    visited[st] = true;
    while (notVisited()) {
        int targ = get(1);
        while (!move(targ)) move(get(0));
    }
}

컴파일 시 표준 에러 (stderr) 메시지

speedrun.cpp: In function 'bool move(int)':
speedrun.cpp:46:13: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   46 |     if (ret = goTo(x + 1)) visited[x] = true;
      |         ~~~~^~~~~~~~~~~~~

• Subtask 1: 21 / 21
• Subtask 2: 8 / 8
• Subtask 3: 19 / 19
• Subtask 4: 12 / 12
• Subtask 5: 40 / 40