Submission #1400720
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; for(int k=0;k<=48;k+=8) for(int x=1;x<=50;x++){ for(int y=1;y<=8;y++){ cout << y+k << " " << x << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Pieces |
User | tkzw_21 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 872 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 256 KB |
Judge Result
Set Name | test_01 | test_02 | test_03 | test_04 | test_05 | test_06 | test_07 | test_08 | test_09 | test_10 | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | 0 / 1343058 | ||||||||||||||||||||
Status |
|
|
|
|
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
test_01 | subtask_01_01.txt |
test_02 | subtask_01_02.txt |
test_03 | subtask_01_03.txt |
test_04 | subtask_01_04.txt |
test_05 | subtask_01_05.txt |
test_06 | subtask_01_06.txt |
test_07 | subtask_01_07.txt |
test_08 | subtask_01_08.txt |
test_09 | subtask_01_09.txt |
test_10 | subtask_01_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_01.txt | WA | 6 ms | 256 KB |
subtask_01_02.txt | WA | 6 ms | 256 KB |
subtask_01_03.txt | WA | 6 ms | 256 KB |
subtask_01_04.txt | WA | 6 ms | 256 KB |
subtask_01_05.txt | WA | 6 ms | 256 KB |
subtask_01_06.txt | WA | 6 ms | 256 KB |
subtask_01_07.txt | WA | 6 ms | 256 KB |
subtask_01_08.txt | WA | 6 ms | 256 KB |
subtask_01_09.txt | WA | 6 ms | 256 KB |
subtask_01_10.txt | WA | 6 ms | 256 KB |