oj.uz

답안 #533779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533779 2022-03-07T08:17:38 Z 79brue Dungeon 2 (JOI16_dungeon2) C++14
98 / 100
 27 ms 10308 KB 
#include "dungeon2.h"
#include <bits/stdc++.h>

using namespace std;

int n;
int deg[40002];
int par[40002], prvNum[40002];
int idx[40002], origCnt;
int origLst[40002];
vector<int> link[40002];
vector<int> toRoot[40002];
bool isOriginal[40002];
int num[40002];

int dfs(int x, int parNum = -1){
//    printf("dfs %d %d\n", x, parNum);
    prvNum[x] = LastRoad();
    deg[x] = NumberOfRoads();

    if(Color() != 1){ /// 이미 방문한 정점
        int ret = Color();
        Move(LastRoad(), Color());
        return ret;
    }

    isOriginal[x] = 1;
    idx[x] = ++origCnt;
    origLst[origCnt] = x;

    for(int i=1; i<=deg[x]; i++){
        if(i == prvNum[x]){
            par[x] = parNum;
            link[x].push_back(parNum);
            toRoot[x].push_back(1);
            continue;
        }
        Move(i, 2);
        link[x].push_back(++n);
        int tmp = dfs(n, x);
        toRoot[x].push_back(tmp==2);
    }

    if(prvNum[x] > 0) Move(prvNum[x], 3);
    return 3;
}

int getBit(int x, int y){
    while(y--) x/=3;
    return x%3+1;
}

int pow3[] = {1, 3, 9, 27, 81, 243};

void dfs2(int x, int bit){
//    printf("dfs2 %d %d\n", x, bit);
    if(isOriginal[x]){ /// 고유한 정점
        num[x] = x;
        for(int i=1; i<=deg[x]; i++){
            if(i==prvNum[x] || toRoot[x][i]) continue;
            Move(i, getBit(idx[x], bit));
            dfs2(link[x][i], bit);
        }
        if(prvNum[x] > 0) Move(prvNum[x], getBit(idx[x], bit));
    }
    else{
        num[x] += (Color() - 1) * pow3[bit];
        Move(LastRoad(), Color());
    }
}

int dist[1002][1002];
int ans[1002];

void Inspect(int R){
    for(int i=0; i<=40000; i++) link[i].push_back(0), toRoot[i].push_back(0);
    dfs(++n);
    for(int i=0; i<6; i++){
        dfs2(1, i);
    }

    for(int i=0; i<=1000; i++) for(int j=0; j<=1000; j++) if(i!=j) dist[i][j] = 1e9;

    for(int i=1; i<=origCnt; i++){
        for(auto y: link[origLst[i]]){
            if(y==0) continue;
//            printf("%d %d\n", i, isOriginal[y] ? idx[y] : num[y]);
            dist[i][isOriginal[y] ? idx[y] : num[y]] = 1;
            dist[isOriginal[y] ? idx[y] : num[y]][i] = 1;
        }
    }

    for(int k=1; k<=origCnt; k++){
        for(int i=1; i<=origCnt; i++){
            for(int j=1; j<=origCnt; j++){
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for(int i=1; i<=origCnt; i++) for(int j=i+1; j<=origCnt; j++) ans[dist[i][j]]++;
    for(int i=1; i<=R; i++) Answer(i, ans[i]);
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8652 KB Output is correct
2 Correct 7 ms 8724 KB Output is correct
3 Correct 7 ms 8652 KB Output is correct
4 Correct 8 ms 8652 KB Output is correct
5 Correct 7 ms 8720 KB Output is correct
6 Correct 7 ms 8684 KB Output is correct
7 Correct 9 ms 8780 KB Output is correct
8 Correct 7 ms 8652 KB Output is correct
9 Correct 7 ms 8652 KB Output is correct
10 Correct 8 ms 8652 KB Output is correct
11 Correct 7 ms 8780 KB Output is correct
12 Correct 7 ms 8684 KB Output is correct
13 Correct 7 ms 8720 KB Output is correct
14 Correct 8 ms 8652 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8592 KB Output is correct
2 Correct 7 ms 8716 KB Output is correct
3 Correct 7 ms 8652 KB Output is correct
4 Correct 8 ms 8752 KB Output is correct
5 Correct 8 ms 8720 KB Output is correct
6 Correct 8 ms 8652 KB Output is correct
7 Correct 10 ms 8652 KB Output is correct
8 Correct 7 ms 8652 KB Output is correct
9 Correct 7 ms 8652 KB Output is correct
10 Correct 7 ms 8720 KB Output is correct
11 Correct 7 ms 8720 KB Output is correct
12 Correct 7 ms 8652 KB Output is correct
13 Correct 8 ms 8652 KB Output is correct
14 Correct 7 ms 8712 KB Output is correct
15 Correct 8 ms 8716 KB Output is correct

Subtask #3
54.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 16 ms 9036 KB Partially correct
2 Partially correct 16 ms 9036 KB Partially correct
3 Partially correct 15 ms 9036 KB Partially correct
4 Partially correct 27 ms 10108 KB Partially correct
5 Partially correct 8 ms 8780 KB Partially correct
6 Partially correct 10 ms 8848 KB Partially correct
7 Partially correct 15 ms 9036 KB Partially correct
8 Partially correct 15 ms 9056 KB Partially correct
9 Partially correct 15 ms 9036 KB Partially correct
10 Partially correct 16 ms 8976 KB Partially correct
11 Partially correct 16 ms 9080 KB Partially correct
12 Partially correct 16 ms 9124 KB Partially correct
13 Partially correct 18 ms 9292 KB Partially correct
14 Partially correct 16 ms 9036 KB Partially correct
15 Partially correct 15 ms 9108 KB Partially correct
16 Partially correct 12 ms 9036 KB Partially correct
17 Partially correct 25 ms 10188 KB Partially correct
18 Partially correct 27 ms 10308 KB Partially correct
19 Partially correct 25 ms 10188 KB Partially correct