oj.uz

답안 #533737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533737 2022-03-07T05:11:05 Z 79brue Dungeon 2 (JOI16_dungeon2) C++14
86 / 100
 26 ms 7792 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];
bool isOriginal[40002];
int num[40002];

void dfs(int x, int parNum = -1){
    prvNum[x] = LastRoad();
    deg[x] = NumberOfRoads();

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

    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);
            continue;
        }
        Move(i, 2);
        link[x].push_back(++n);
        dfs(n, x);
    }
    if(prvNum[x] > 0) Move(prvNum[x], 2);
}

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){
    if(isOriginal[x]){ /// 고유한 정점
        num[x] = x;
        for(int i=1; i<=deg[x]; i++){
            if(i==prvNum[x]) continue;
            Move(i, getBit(idx[x], bit));
            dfs2(link[x][i], bit);
        }
        if(prvNum[x] > 0) Move(prvNum[x], 2);
    }
    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);
    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]]){
            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 5 ms 6476 KB Output is correct
2 Correct 5 ms 6476 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 7 ms 6476 KB Output is correct
5 Correct 5 ms 6476 KB Output is correct
6 Correct 5 ms 6476 KB Output is correct
7 Correct 5 ms 6476 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6476 KB Output is correct
11 Correct 5 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6476 KB Output is correct
14 Correct 5 ms 6476 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6476 KB Output is correct
2 Correct 5 ms 6476 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6476 KB Output is correct
5 Correct 4 ms 6476 KB Output is correct
6 Correct 5 ms 6476 KB Output is correct
7 Correct 5 ms 6476 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 7 ms 6476 KB Output is correct
10 Correct 5 ms 6460 KB Output is correct
11 Correct 5 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 6 ms 6476 KB Output is correct
14 Correct 5 ms 6504 KB Output is correct
15 Correct 5 ms 6540 KB Output is correct

Subtask #3
42.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 12 ms 6732 KB Partially correct
2 Partially correct 12 ms 6868 KB Partially correct
3 Partially correct 13 ms 6916 KB Partially correct
4 Partially correct 26 ms 7712 KB Partially correct
5 Partially correct 6 ms 6500 KB Partially correct
6 Partially correct 7 ms 6736 KB Partially correct
7 Partially correct 14 ms 6884 KB Partially correct
8 Partially correct 16 ms 7004 KB Partially correct
9 Partially correct 13 ms 6900 KB Partially correct
10 Partially correct 14 ms 6864 KB Partially correct
11 Partially correct 13 ms 6892 KB Partially correct
12 Partially correct 12 ms 6864 KB Partially correct
13 Partially correct 15 ms 7028 KB Partially correct
14 Partially correct 12 ms 6760 KB Partially correct
15 Partially correct 13 ms 6764 KB Partially correct
16 Partially correct 8 ms 6864 KB Partially correct
17 Partially correct 25 ms 7760 KB Partially correct
18 Partially correct 26 ms 7728 KB Partially correct
19 Partially correct 25 ms 7792 KB Partially correct