Submission #981812

#	Time	Username	Problem	Language	Result	Execution time	Memory
981812		yoav_s	Swapping Cities (APIO20_swap)	C++17	0 / 100	2 ms	604 KiB

swap

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

typedef long long ll;
typedef pair<ll,ll> p;
typedef pair<ll, p> tri;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<p> vp;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<vv> vvv;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef vector<vvvp> vvvvp;
#define double long double
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;

const ll mod = 1e9 + 7;
const ll INF = 1e18;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define loop(a) for (ll i = 0; i < a; i++)
#define setmin(a, b) a = min(a, b)
#define setmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()

#include "swap.h"
ll res = -1;
v degree;
vv graph;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vp edgesByW;
    for (ll i = 0; i < M; i++)
    {
        edgesByW.eb(W[i], i);
    }
    sort(all(edgesByW));
    degree = v(N, 0);
    graph = vv(N);
    for (auto x : edgesByW)
    {
        degree[V[x.s]]++;
        degree[W[x.s]]++;
        graph[V[x.s]].pb(W[x.s]);
        graph[W[x.s]].pb(V[x.s]);
        if (degree[V[x.s]] >= 3 || degree[W[x.s]] >= 3)
        {
            if (res == -1)
                res = x.f;
        }
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if (degree[X] == degree[Y] && degree[X] == 1 && graph[X][0] == graph[Y][0]) return -1;
    return res;
}
/*
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)

swap.cpp:101:1: warning: "/*" within comment [-Wcomment]
  101 | /**/
      |

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