Submission #1005206


Source Code Expand

#include <algorithm>
#include <cassert>
#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 <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 eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#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 > >;

int main() {
  int n;
  scanf("%d", &n);
  int m = 170000;
  vi x(m), y(m);
  int k = 0;

  for (int i = 1; i < n; i += 3) {
    for (int j = (i % 2 == 1) ? 0 : 1; j < n; j += 2) {
      x[k] = i;
      y[k] = j;
      k += 1;
    }
  }
  if (n % 3 == 1) {
    for (int i = ((n-1) % 2 == 1) ? 0 : 1; i < n; i += 2) {
      x[k] = n-1;
      y[k] = i;
      k += 1;
    }
  }
  rep (i, n-1) {
    if (i % 2 == 0 || i % 3 == 1) {
      continue;
    }
    x[k] = i;
    y[k] = 0;
    k += 1;
  }
  printf("%d\n", k);
  rep (i, k) {
    printf("%d %d\n", x[i], y[i]);
  }

  return 0;
}

Submission Info

Submission Time
Task J - Connected Checkerboard
User tspcx
Language C++14 (Clang 3.8.0)
Score 100
Code Size 1566 Byte
Status AC
Exec Time 28 ms
Memory 2816 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 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 4 ms 1536 KB
sample_02.txt AC 4 ms 1536 KB
subtask1_01.txt AC 5 ms 1664 KB
subtask1_02.txt AC 4 ms 1536 KB
subtask1_03.txt AC 7 ms 1664 KB
subtask1_04.txt AC 6 ms 1664 KB
subtask1_05.txt AC 12 ms 1920 KB
subtask1_06.txt AC 16 ms 2176 KB
subtask1_07.txt AC 6 ms 1664 KB
subtask1_08.txt AC 17 ms 2304 KB
subtask1_09.txt AC 15 ms 2176 KB
subtask1_10.txt AC 28 ms 2816 KB
subtask1_11.txt AC 27 ms 2816 KB
subtask1_12.txt AC 27 ms 2816 KB
subtask1_13.txt AC 28 ms 2816 KB
subtask1_14.txt AC 27 ms 2816 KB
subtask1_15.txt AC 26 ms 2816 KB
subtask1_16.txt AC 26 ms 2688 KB
subtask1_17.txt AC 26 ms 2816 KB
subtask1_18.txt AC 26 ms 2816 KB
subtask1_19.txt AC 28 ms 2816 KB
subtask1_20.txt AC 28 ms 2816 KB