oj.uz

답안 #569900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569900 2022-05-28T05:29:06 Z sumit_kk10 자매 도시 (APIO20_swap) C++17
6 / 100
 300 ms 37152 KB 
#include "swap.h"
#include<bits/stdc++.h>
#include <vector>
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
vector<pair<int, int> > g[N];
int mx, n, m;
bool sb2 = 1, sb1 = 1;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;
	map<int, int> mp;
	int wut;
	for(int i = 0; i < M; ++i){
		int u = U[i], v = V[i], w = W[i];
		if(u != 0 and v != 0)
			sb2 = false;
		g[u].pb({w, v});
		g[v].pb({w, u});
		mp[u]++;
		mp[v]++;
		mx = max(mx, w);
	}
	for(int i = 0; i < n; ++i)
		sort(g[i].begin(), g[i].end());
	for(auto k : mp)
		wut = max(wut, k.second);
	if(wut > 2)
		sb1 = false;
}
 
int getMinimumFuelCapacity(int X, int Y) {
	if(sb2 and m == n - 1){
		if(n <= 3) return -1;
		if(X == 0){
			int x = g[Y][0].second, xx, dest, mn;
			if(g[0][0].second != Y){
				xx = g[0][0].first;
				dest = g[0][0].second;
			}else{
				xx = g[0][1].first;
				dest = g[0][1].second;
			}
			if(g[0][1].second != Y and g[0][1].second != dest)
				mn = g[0][1].first;
			else
				mn = g[0][2].first;
			return max({x, xx, mn});
		}
		int x = g[X][0].second, xx = g[Y][0].second, mn;
		if(g[0][0].second != X and g[0][0].second != Y)
			mn = g[0][0].first;
		else if(g[0][1].second != X and g[0][1].second != Y)
			mn = g[0][1].first;
		else
			mn = g[0][2].first;
		return max({x, xx, mn});
	}
	if(sb1){
		if(m == n - 1)
			return -1;
		else
			return mx;
	}
}

Compilation message

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^
swap.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
swap.cpp:31:2: warning: 'wut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  if(wut > 2)
      |  ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 15 ms 23660 KB Output is correct
3 Correct 12 ms 23768 KB Output is correct
4 Correct 12 ms 23824 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23800 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Correct 132 ms 31820 KB Output is correct
10 Correct 153 ms 33512 KB Output is correct
11 Correct 177 ms 33372 KB Output is correct
12 Correct 175 ms 33868 KB Output is correct
13 Correct 148 ms 33868 KB Output is correct
14 Correct 118 ms 31876 KB Output is correct
15 Correct 267 ms 35416 KB Output is correct
16 Correct 204 ms 35160 KB Output is correct
17 Correct 206 ms 35640 KB Output is correct
18 Correct 300 ms 35636 KB Output is correct
19 Correct 71 ms 28812 KB Output is correct
20 Correct 192 ms 36552 KB Output is correct
21 Correct 237 ms 36488 KB Output is correct
22 Correct 207 ms 37152 KB Output is correct
23 Correct 224 ms 37072 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 15 ms 23660 KB Output is correct
3 Incorrect 220 ms 36204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 15 ms 23660 KB Output is correct
3 Correct 12 ms 23768 KB Output is correct
4 Correct 12 ms 23824 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23800 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Incorrect 12 ms 23764 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 15 ms 23660 KB Output is correct
3 Correct 12 ms 23768 KB Output is correct
4 Correct 12 ms 23824 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23800 KB Output is correct
8 Correct 14 ms 23764 KB Output is correct
9 Correct 132 ms 31820 KB Output is correct
10 Correct 153 ms 33512 KB Output is correct
11 Correct 177 ms 33372 KB Output is correct
12 Correct 175 ms 33868 KB Output is correct
13 Correct 148 ms 33868 KB Output is correct
14 Correct 118 ms 31876 KB Output is correct
15 Correct 267 ms 35416 KB Output is correct
16 Correct 204 ms 35160 KB Output is correct
17 Correct 206 ms 35640 KB Output is correct
18 Correct 300 ms 35636 KB Output is correct
19 Incorrect 220 ms 36204 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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