oj.uz

답안 #259087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259087 2020-08-07T07:11:50 Z 반딧불(#5071) 한자 끝말잇기 (JOI14_kanji) C++14
0 / 100
 186 ms 13952 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;

typedef long long ll;

namespace ANNA{
    ll dist[302][302];
    int track[302][302];
    int message[302];
    bool know[302];
    ll dt[302];
};
using namespace ANNA;

void Anna(int n, int k, int A[], int B[], ll C[], int q, int S[], int T[], int m, int U[]) {
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i!=j) dist[i][j] = 4 * 1e18;
        }
    }
    for(int i=0; i<m; i++) know[U[i]] = 1;
    for(int i=0; i<k; i++){
        if(!know[i]) dist[A[i]][B[i]] = C[i];
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            for(int x=0; x<n; x++){
                if(dist[i][x] + dist[x][j] < dist[i][j]){
                    track[i][j] = x;
                    dist[i][j] = dist[i][x] + dist[x][j];
                }
            }
        }
    }

    int stP = A[U[0]];

    for(int i=0; i<q; i++){
        dt[i] = dist[S[i]][T[i]];
        for(int j=0; j<m; j++){
            if(dt[i] > dist[S[i]][stP] + C[U[j]] + dist[B[U[j]]][T[i]]){
                dt[i] = dist[S[i]][stP] + C[U[j]] + dist[B[U[j]]][T[i]];
                message[i] = j+1;
            }
        }
        if(dt[i] > 3*1e18) exit(1);
    }
    for(int i=0; i<60; i+=3){
        int mes = message[i] + message[i+1] * 6 + message[i+2] * 36;
        for(int j=0; j<8; j++){
            Tap(!!(mes & (1<<j)));
        }
    }
}

#include <bits/stdc++.h>
#include "Brunolib.h"

using namespace std;

typedef long long ll;

namespace BRUNO{
    ll dist[302][302];
    int track[302][302];
    int message[302];
    bool know[302];
    ll dt[302];
};
using namespace BRUNO;

void answer(int x, int y){
    if(x==y) return;
    if(track[x][y] < 0){
        Answer(-track[x][y]-100);
        return;
    }
    int z = track[x][y];
    answer(x, z);
    answer(z, y);
}

void Bruno(int n, int k, int A[], int B[], ll C[], int q, int S[], int T[], int m, int U[], int L, int X[]) {
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i!=j) dist[i][j] = 4 * 1e18;
        }
    }
    for(int i=0; i<m; i++) know[U[i]] = 1;
    for(int i=0; i<k; i++){
        if(!know[i]) dist[A[i]][B[i]] = C[i], track[A[i]][B[i]] = -i-100;
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            for(int x=0; x<n; x++){
                if(dist[i][x] + dist[x][j] < dist[i][j]){
                    track[i][j] = x;
                    dist[i][j] = dist[i][x] + dist[x][j];
                }
            }
        }
    }

    for(int i=0; i<60; i+=3){
        int mes = 0;
        for(int j=0; j<8; j++){
            mes += (1<<j) * X[i/3*8+j];
        }
        message[i] = mes % 6;
        message[i+1] = mes / 6 % 6;
        message[i+2] = mes / 36;
    }

    for(int i=0; i<q; i++){
        if(message[i] == 0){
            answer(S[i], T[i]);
        }
        else{
            answer(S[i], A[U[0]]);
            Answer(U[message[i] - 1]);
            answer(B[U[message[i]-1]], T[i]);
        }
        Answer(-1);
    }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 31 ms 3192 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 29 ms 3328 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 29 ms 3320 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 38 ms 3308 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 30 ms 3340 KB Execution failed because the return code was nonzero
2 Runtime error 33 ms 3328 KB Execution failed because the return code was nonzero
3 Runtime error 32 ms 3328 KB Execution failed because the return code was nonzero
4 Runtime error 32 ms 3344 KB Execution failed because the return code was nonzero
5 Runtime error 33 ms 3328 KB Execution failed because the return code was nonzero
6 Runtime error 34 ms 3328 KB Execution failed because the return code was nonzero
7 Runtime error 32 ms 3328 KB Execution failed because the return code was nonzero
8 Runtime error 35 ms 3320 KB Execution failed because the return code was nonzero
9 Runtime error 29 ms 3328 KB Execution failed because the return code was nonzero
10 Runtime error 29 ms 3328 KB Execution failed because the return code was nonzero
11 Runtime error 30 ms 3328 KB Execution failed because the return code was nonzero
12 Runtime error 30 ms 3320 KB Execution failed because the return code was nonzero
13 Incorrect 186 ms 13952 KB Output isn't correct - Wrong Answer [9]
14 Runtime error 30 ms 3320 KB Execution failed because the return code was nonzero
15 Runtime error 29 ms 3320 KB Execution failed because the return code was nonzero
16 Runtime error 36 ms 3328 KB Execution failed because the return code was nonzero
17 Incorrect 84 ms 7296 KB Output isn't correct - Wrong Answer [9]
18 Incorrect 83 ms 7360 KB Output isn't correct - Wrong Answer [9]
19 Runtime error 30 ms 3200 KB Execution failed because the return code was nonzero
20 Correct 80 ms 7676 KB Output isn't correct - L = 160
21 Incorrect 88 ms 7664 KB Output isn't correct - Wrong Answer [9]
22 Runtime error 32 ms 3328 KB Execution failed because the return code was nonzero
23 Runtime error 29 ms 3328 KB Execution failed because the return code was nonzero
24 Runtime error 30 ms 3320 KB Execution failed because the return code was nonzero