Submission #1368433

#	Time	Username	Problem	Language	Result	Execution time	Memory
1368433		greedyaj	Swapping Cities (APIO20_swap)	C++20	Compilation error	0 ms	0 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;

int n,m;
vector<int> u;
vector<int> v;
vector<int> w;

vector<int> edges;
multiset<int> ms;

const int INF = 1e9 + 1;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    n = N;
    m = M;
    u = U;
    v = V;
    w = W;

    edges = vector<int>(n);

    for(int i = 0; i < n - 1; i++){
      edges[v[i]] = i;
      ms.insert(w[i]);
    }
}

int getMinimumFuelCapacity(int x, int y) {
  if(n - 1 <= 2) return -1;
  if(x == 0){
    ms.erase(ms.find(w[edges[y]]));
    int minx = *ms.begin(); int sminx = *(next(ms.begin()));
    ms.insert(w[edges[y]]);
    return max({w[edges[y]],minx,sminx});
  } else{
    ms.erase(ms.find(w[edges[x]]));
    ms.erase(ms.find(w[edges[y]]));
    int minx = *ms.begin();
    ms.insert(w[edges[x]]);
    ms.insert(w[edges[y]]);
    return max({w[edges[x]],w[edges[y]],minx});
  }
}

int main() {
  int N, M;
  assert(2 == scanf("%d %d", &N, &M));
  
  std::vector<int> U(M), V(M), W(M);
  for (int i = 0; i < M; ++i) {
    assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
  }

  int Q;
  assert(1 == scanf("%d", &Q));

  std::vector<int> X(Q), Y(Q);
  for (int i = 0; i < Q; ++i) {
    assert(2 == scanf("%d %d", &X[i], &Y[i]));
  }

  init(N, M, U, V, W);
  
  std::vector<int> minimum_fuel_capacities(Q);
  for (int i = 0; i < Q; ++i) {
    minimum_fuel_capacities[i] = getMinimumFuelCapacity(X[i], Y[i]);
  }

  for (int i = 0; i < Q; ++i) {
    printf("%d\n", minimum_fuel_capacities[i]);
  }
  
  return 0;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccMN0FLa.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccGrJcox.o:swap.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status