Submission #554875

#TimeUsernameProblemLanguageResultExecution timeMemory
554875Zhora_004자매 도시 (APIO20_swap)C++17
0 / 100
2066 ms10016 KiB
#include "swap.h" #include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <set> #include <unordered_set> #include <queue> #include <deque> #include <string> #include <sstream> #include <iomanip> #include <map> #include <unordered_map> #include <stack> #include <cstdio> #include <climits> #include <tuple> #include <ctime> #include <cstring> #include <numeric> #include <functional> #include <chrono> #include <cassert> #include <bitset> #include <fstream> #define sz(a) ((int)((a).size())) // printf("%.10f\n", ans); using ll = long long; using namespace std; int n, m; vector<int> a, b, c; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n = N; m = M; a = U; b = V; c = W; } int getMinimumFuelCapacity(int X, int Y) { if (m == n - 1) return -1; int mx = 0; for (int& i : c) mx = max(mx, i); return mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...