oj.uz

Submission #297807

# Submission time Handle Problem Language Result Execution time Memory
297807 2020-09-12T01:43:25 Z anonymous 한자 끝말잇기 (JOI14_kanji) C++14
0 / 100
 189 ms 18076 KB 
// Camping template
// Optional, but helps you to not accidently share data by using namespaces

#include "Annalib.h"
#include <iostream>
#include <vector>
#include <cassert>
#define MAXN 305
#define LL long long
#define INF ((LL) 4e18 + 5e17)
using namespace std;
namespace AnnaCode {
	// Put all global variables or functions for Anna here
	LL dist[MAXN][MAXN];
	void Anna(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[]) {
		// Put your code here
		for (int i=0; i<N; i++) {
            for (int j=0; j < N; j++) {
                dist[i][j] = i == j ? 0 : INF;
            }
		}
		for (int i=0; i<M; i++) {
            dist[A[i]][B[i]] = C[i];
		}
		for (int k=0; k<N; k++) {
            for (int i=0; i<N; i++) {
                for (int j=0; j<N; j++) {
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
		}
		//cout << "Check dist" << dist[0][1] << endl;
		int Type[1005]={};
		for (int q=0; q < Q; q++) {
            for (int i=0; i<K; i++) {
                if (dist[S[q]][T[q]] == dist[S[q]][A[U[i]]] + dist[B[U[i]]][T[q]] + C[U[i]]) {
                    Type[q] = i+1;
                    break;
                }
            }
            //printf("Status of %d = %d\n",q,Type[q]);
		}
		for (int i=0; i<60; i+=5) {
            //sends 156 bits regardless
            int res = 0, exp=1;
            for (int j=i; j<i+5; j++) {
                res += Type[j] * exp;
                exp = exp*6;
            }
            for (int b=1; b < 8192; b*=2) {
                if (res & b) {Tap(1);}
                else {Tap(0);}
            }
		}

	}
}

void Anna(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[]) {
	AnnaCode::Anna(N, M, A, B, C, Q, S, T, K, U);
}

// Camping template
// Optional, but helps you to not accidently share data by using namespaces

#include "Brunolib.h"
#include <iostream>
#include <vector>
#include <cassert>
#define MAXN 305
#define LL long long
#define INF ((LL) 4e18 + 5e17)
using namespace std;

namespace BrunoCode {
	// Put all global variables or functions for Bruno here
	LL dist[MAXN][MAXN];
    int adj[MAXN][MAXN], N;
	void gen(int s, int t) {
        while (s != t) {
            bool good = false;
            for (int i=0; i<N; i++) {
                if (adj[s][i] != -1 && dist[s][i] + dist[i][t] == dist[s][t]) {
                    Answer(adj[s][i]);
                    s = i;
                    good = true;
                    break;
                }
            }
           // assert(good);
        }
	}

	void Bruno(int n,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[],int L,int X[]) {
		// Put your code here
		N=n;
        for (int i=0; i<N; i++) {
            for (int j=0; j < N; j++) {
                dist[i][j] = i == j ? 0 : INF;
                adj[i][j] = -1;
            }
		}
		for (int i=0; i<M; i++) {
            dist[A[i]][B[i]] = C[i];
            if (C[i] != -1) {adj[A[i]][B[i]] = i;}
            if (C[i] == -1) {dist[A[i]][B[i]]= INF;}
		}
		for (int k=0; k<N; k++) {
            for (int i=0; i<N; i++) {
                for (int j=0; j<N; j++) {
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
		}
		//assert(L == 156);
		int Status[1000];
		//decode
		int cur = 0;
		for (int i=0; i<156; i+=13) {
            int res = 0;
            for (int j=i; j < i+13; j++) {
                res += (1<<(j-i)) * X[j];
            }
            for (int j=0; j<5; j++) {
                Status[cur] = res % 6;
                res /= 6, cur++;
            }
		}
		for (int q=0; q < Q; q++) {
            //printf("Read Status of %d = %d\n",q, Status[q]);
            if (Status[q] == 0) {
                gen(S[q], T[q]);
            } else {
                int a = A[U[Status[q]-1]], b = B[U[Status[q]-1]];
                gen(S[q], a);
                Answer(U[Status[q]-1]);
                gen(b, T[q]);
            }
            Answer(-1);
		}
	}
}

void Bruno(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[],int L,int X[]) {
	BrunoCode::Bruno(N, M, A, B, C, Q, S, T, K, U, L, X);
}

Compilation message

Bruno.cpp: In function 'void BrunoCode::gen(int, int)':
Bruno.cpp:19:18: warning: variable 'good' set but not used [-Wunused-but-set-variable]
   19 |             bool good = false;
      |                  ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6344 KB Output is correct - L = 156
2 Correct 71 ms 6412 KB Output is correct - L = 156
3 Correct 64 ms 6408 KB Output is correct - L = 156
4 Correct 67 ms 6308 KB Output is correct - L = 156
5 Correct 65 ms 6424 KB Output is correct - L = 156
6 Correct 65 ms 6296 KB Output is correct - L = 156
7 Correct 66 ms 6172 KB Output is correct - L = 156
8 Correct 66 ms 6540 KB Output is correct - L = 156
9 Correct 68 ms 6392 KB Output is correct - L = 156
10 Correct 69 ms 6612 KB Output is correct - L = 156
11 Correct 65 ms 6452 KB Output is correct - L = 156
12 Incorrect 184 ms 17688 KB Output isn't correct - Wrong Answer [9]
13 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 6580 KB Output is correct - L = 156
2 Correct 68 ms 6324 KB Output is correct - L = 156
3 Correct 65 ms 6572 KB Output is correct - L = 156
4 Incorrect 74 ms 6676 KB Output isn't correct - Wrong Answer [9]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 6444 KB Output is correct - L = 156
2 Correct 71 ms 6324 KB Output is correct - L = 156
3 Correct 66 ms 6564 KB Output is correct - L = 156
4 Incorrect 66 ms 6664 KB Output isn't correct - Wrong Answer [9]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 68 ms 6664 KB Output isn't correct - L = 156
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 6664 KB Output isn't correct - L = 156
2 Correct 70 ms 6636 KB Output isn't correct - L = 156
3 Correct 67 ms 6580 KB Output isn't correct - L = 156
4 Incorrect 75 ms 6596 KB Output isn't correct - Wrong Answer [9]
5 Correct 70 ms 6332 KB Output isn't correct - L = 156
6 Correct 67 ms 6712 KB Output isn't correct - L = 156
7 Correct 68 ms 6588 KB Output isn't correct - L = 156
8 Correct 66 ms 6772 KB Output isn't correct - L = 156
9 Correct 67 ms 6604 KB Output isn't correct - L = 156
10 Correct 71 ms 6800 KB Output isn't correct - L = 156
11 Correct 67 ms 6784 KB Output isn't correct - L = 156
12 Correct 68 ms 6708 KB Output isn't correct - L = 156
13 Incorrect 189 ms 18076 KB Output isn't correct - Wrong Answer [9]
14 Correct 66 ms 6572 KB Output isn't correct - L = 156
15 Correct 66 ms 6676 KB Output isn't correct - L = 156
16 Correct 69 ms 6940 KB Output isn't correct - L = 156
17 Correct 69 ms 6996 KB Output isn't correct - L = 156
18 Correct 75 ms 7440 KB Output isn't correct - L = 156
19 Correct 66 ms 6428 KB Output isn't correct - L = 156
20 Correct 80 ms 7944 KB Output isn't correct - L = 156
21 Incorrect 80 ms 7928 KB Output isn't correct - Wrong Answer [9]
22 Correct 78 ms 6780 KB Output isn't correct - L = 156
23 Correct 69 ms 6800 KB Output isn't correct - L = 156
24 Correct 66 ms 6676 KB Output isn't correct - L = 156