oj.uz

답안 #427908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427908 2021-06-15T04:49:51 Z amoo_safar Escape Route (JOI21_escape_route) C++17
0 / 100
 190 ms 112008 KB 
#include "escape_route.h"

#include<bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define debug(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const int N = 92;

int n, m;
ll S;

vi A, B;
vl L, C;
vector<int> G[N];

// ll dis[N], mk[N];

// void Djik(int src, ll st){
// 	memset(dis, 31, sizeof dis);
// 	memset(mk, 0, sizeof mk);
// 	dis[src] = st;
// 	int adj;
// 	ll w;
// 	for(int _ = 0; _ < n; _++){
// 		int idx = -1;
// 		for(int i = 0; i < n; i++) if(!mk[i]) idx = i;
// 		if(idx == -1) continue;
// 		for(int i = 0; i < n; i++) if(!mk[i] && dis[i] < dis[idx]) idx = i;
// 		mk[idx] = 1;
// 		for(auto e : G[idx]){
// 			adj = A[e] ^ B[e] ^ idx;
// 			if(dis[idx] % S <= C[e] - L[e])
// 				w = dis[idx] + L[e];
// 			else 
// 				w = dis[idx] + (S - (dis[idx] % S)) + L[e];
// 			if(w < dis[adj])
// 				dis[adj] = w;
// 		}
// 	}
// }


ll dis[N][N][N]; // no of act. u. adj
ll tim[N][N], po[N];  // no of act. u.
ll Get(int u, int v, ll st){
	int L = -1, R = po[u], mid;
}

vl calculate_necessary_time(int _n, int _m, ll _S, int Q, vi _A, vi _B, vl _L, vl _C, vi _U, vi _V, vl _T) {
	n = _n; m = _m; S = _S;
	A = _A; B = _B; L = _L; C = _C;
	for(int i = 0; i < m; i++)
		G[A[i]].pb(i), G[B[i]].pb(i);

	vl ANS(Q, 0);
	// for(int i = 0; i < Q; i++){
	// 	Djik(_U[i], _T[i]);
	// 	ANS.pb(dis[_V[i]] - _T[i]);
	// }
	return ANS;
}

Compilation message

escape_route.cpp: In function 'll Get(int, int, ll)':
escape_route.cpp:56:6: warning: unused variable 'L' [-Wunused-variable]
   56 |  int L = -1, R = po[u], mid;
      |      ^
escape_route.cpp:56:14: warning: unused variable 'R' [-Wunused-variable]
   56 |  int L = -1, R = po[u], mid;
      |              ^
escape_route.cpp:56:25: warning: unused variable 'mid' [-Wunused-variable]
   56 |  int L = -1, R = po[u], mid;
      |                         ^~~
escape_route.cpp:57:1: warning: no return statement in function returning non-void [-Wreturn-type]
   57 | }
      | ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 64952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 190 ms 112008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 64952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 64952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 64952 KB Output isn't correct
2 Halted 0 ms 0 KB -