# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5987 | model_code | 한자 끝말잇기 (JOI14_kanji) | C++98 | 262 ms | 13540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
#include "Annalib.h"
using namespace std;
#define NMAX 310
#define MMAX 90010
#define QMAX 100
#define KMAX 15
#define UNDEF -1
static void wf(int N,int M, int A[],int B[], long long C[],long long dist[NMAX][NMAX],int next[NMAX][NMAX]){
for(int i=0;i<N;i++){
fill(dist[i],dist[i]+N,UNDEF);
fill(next[i],next[i]+N,-1);
for(int j=0;j<N;j++){
if(i==j){dist[i][j]=0;}
}
}
for(int i=0;i<M;i++){
dist[A[i]][B[i]]=C[i];
next[A[i]][B[i]]=i;
}
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |