AtCoder Beginner Contest 040

Submission #1110580

Source codeソースコード

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

struct UF {
  vector<int> par; // parent
  vector<int> sizes;
  UF(int n) : par(n), sizes(n, 1) {
    for (int i = 0; i < n; ++i) {
      par[i] = i;
    }
  }
  int root(int x) {
    if (x == par[x]) {
      return x;
    }
    return par[x] = root(par[x]);
  }
  void unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) {
      return;
    }
    if (sizes[x] < sizes[y]) {
      swap(x, y);
    }
    par[y] = x;
    sizes[x] += sizes[y];
    sizes[y] = 0;
  }
  bool same(int x, int y) {
    return root(x) == root(y);
  }
  int size(int x) {
    return sizes[root(x)];
  }
};

int main() {
  int maxy = 200001;
  int n, m;
  scanf("%d %d", &n, &m);
  vvi ab(m, vi(2));
  vector<set<int> > y_p(maxy);
  rep (i, m) {
    int y;
    scanf("%d %d %d", &ab[i][0], &ab[i][1], &y);
    ab[i][0] -= 1; ab[i][1] -= 1;
    y_p[y].insert(i);
  }

  int q;
  scanf("%d", &q);
  vi v(q);
  vector<set<int> > y_r(maxy);
  rep (i, q) {
    int y;
    scanf("%d %d", &v[i], &y);
    v[i] -= 1;
    y_r[y].insert(i);
  }

  UF uf(n);
  vi ans(q);
  for (int y = 200000; y >= 0; --y) {
    for (int j : y_r[y]) {
      ans[j] = uf.size(v[j]);
    }
    for (int j : y_p[y]) {
      uf.unite(ab[j][0], ab[j][1]);
    }
  }
  rep (i, q) {
    printf("%d\n", ans[i]);
  }

  return 0;
}

Submission

Task問題 D - 道路の老朽化対策について
User nameユーザ名 gosenoku
Created time投稿日時
Language言語 C++14 (Clang 3.8.0)
Status状態 AC
Score得点 100
Source lengthソースコード長 2262 Byte
File nameファイル名
Exec time実行時間 262 ms
Memory usageメモリ使用量 36736 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_01.txt,sample_02.txt,sample_03.txt
Subtask1 50 / 50 sample_01.txt,sample_02.txt,sample_03.txt,subtask1_01.txt,subtask1_02.txt,subtask1_03.txt,subtask1_04.txt,subtask1_05.txt,subtask1_06.txt,subtask1_07.txt
All 50 / 50 sample_01.txt,sample_02.txt,sample_03.txt,subtask1_01.txt,subtask1_02.txt,subtask1_03.txt,subtask1_04.txt,subtask1_05.txt,subtask1_06.txt,subtask1_07.txt,subtask2_01.txt,subtask2_02.txt,subtask2_03.txt,subtask2_04.txt,subtask2_05.txt,subtask2_06.txt,subtask2_07.txt,subtask2_08.txt,subtask2_09.txt,subtask2_10.txt,subtask2_11.txt,subtask2_12.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt AC 18 ms 9848 KB
sample_02.txt AC 15 ms 9600 KB
sample_03.txt AC 15 ms 9600 KB
subtask1_01.txt AC 17 ms 9856 KB
subtask1_02.txt AC 17 ms 9856 KB
subtask1_03.txt AC 17 ms 9856 KB
subtask1_04.txt AC 16 ms 9728 KB
subtask1_05.txt AC 17 ms 9856 KB
subtask1_06.txt AC 17 ms 9856 KB
subtask1_07.txt AC 17 ms 9856 KB
subtask2_01.txt AC 262 ms 36608 KB
subtask2_02.txt AC 242 ms 36608 KB
subtask2_03.txt AC 241 ms 36608 KB
subtask2_04.txt AC 222 ms 36608 KB
subtask2_05.txt AC 102 ms 26112 KB
subtask2_06.txt AC 254 ms 36736 KB
subtask2_07.txt AC 221 ms 36736 KB
subtask2_08.txt AC 213 ms 36736 KB
subtask2_09.txt AC 221 ms 36608 KB
subtask2_10.txt AC 225 ms 36608 KB
subtask2_11.txt AC 229 ms 36480 KB
subtask2_12.txt AC 228 ms 36352 KB