제출 #979625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979625		vjudge1	Swapping Cities (APIO20_swap)	C++17	0 / 100	2 ms	6492 KiB

swap

#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>


// #include "swap.h"

#include <cassert>
#include <cstdio>

#include <string>

#include <vector>
using namespace std;
vector<pair<int, int>> g[200005];
pair<int, int> p[200005];
map<pair<int, int>, int> mp, pos;
set<pair<int, int>> st;
int N, M;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
      for(int i = 0; i < M; i++){
          int a = U[i] + 1, b = V[i] + 1, c = W[i] + 1;
          g[a].push_back({b, c});
          g[b].push_back({a, c});
          mp[{a, b}] = c;
          mp[{b, a}] = c;

          pos[{a, b}] = i + 1;
          pos[{b, a}] = i + 1;

          st.insert({c, i + 1});
      }
}

int getMinimumFuelCapacity(int X, int Y) {
    X++;
    Y++;
    if(N == M) return st.rbegin()->first;
    else return -1;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27