Submission #1400733

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
struct UnionFind{
  vector<int> par;
  vector<int> sizes;
  UnionFind(int n):par(n),sizes(n,1){
    for(int i=0;i<n;i++)par[i] = i;
  }
  int find(int x){
    if(x == par[x])return x;
    return par[x] = find(par[x]);
  }
  void unite(int x,int y){
    x = find(x);y = find(y);
    if(x == y)return;
    if(sizes[x] < sizes[y])swap(x,y);
    par[y] = x;
    sizes[x] += sizes[y];
  }
  bool same(int x,int y){
    return find(x) == find(y);
  }
  int size(int x){
    return sizes[find(x)];
  }
};

int main(void){
	int H,W,K;
  cin >> H >> W >> K;
  vector<string> s(H);
  for(int i=0;i<H;i++){
    cin >> s[i];
  }

  cout << 300 << endl;
  int cnt = 0;
  for(int k=0;k<6;k++)
  for(int x=1;x<=50;x++){
    for(int y=1;y<=8;y++){
      cnt++;
      cout << y+k*8 << " " << x << endl;
    }
  }
  cerr << cnt/8 << endl;

	return 0;
}

Submission Info

Judge Result