Submission #1261117
Source Code Expand
#define _USE_MATH_DEFINES #include <cstdio> #include <iostream> #include <sstream> #include <fstream> #include <iomanip> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <vector> #include <list> #include <queue> #include <stack> #include <set> #include <map> #include <bitset> #include <numeric> #include <limits> #include <climits> #include <cfloat> #include <functional> #include <iterator> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > v; for(int y=1; y<n; y+=2) v.push_back(make_pair(0, y)); for(int x=2-n%2; x<n; x+=2) v.push_back(make_pair(x, n-1)); for(int y=1; y<n-1; y+=3){ for(int x=1+y%2; x<n; x+=2){ v.push_back(make_pair(x, y)); } } cout << v.size() << endl; for(const auto& p : v) cout << p.first << ' ' << p.second << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | J - Connected Checkerboard |
User | mamekin |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 958 Byte |
Status | AC |
Exec Time | 271 ms |
Memory | 2928 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 12 ms | 384 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 34 ms | 640 KB |
subtask1_04.txt | AC | 14 ms | 384 KB |
subtask1_05.txt | AC | 85 ms | 1144 KB |
subtask1_06.txt | AC | 138 ms | 1652 KB |
subtask1_07.txt | AC | 23 ms | 512 KB |
subtask1_08.txt | AC | 146 ms | 1780 KB |
subtask1_09.txt | AC | 126 ms | 1524 KB |
subtask1_10.txt | AC | 265 ms | 2928 KB |
subtask1_11.txt | AC | 269 ms | 2800 KB |
subtask1_12.txt | AC | 253 ms | 2800 KB |
subtask1_13.txt | AC | 266 ms | 2928 KB |
subtask1_14.txt | AC | 257 ms | 2800 KB |
subtask1_15.txt | AC | 253 ms | 2800 KB |
subtask1_16.txt | AC | 249 ms | 2672 KB |
subtask1_17.txt | AC | 255 ms | 2800 KB |
subtask1_18.txt | AC | 251 ms | 2800 KB |
subtask1_19.txt | AC | 261 ms | 2928 KB |
subtask1_20.txt | AC | 271 ms | 2928 KB |