Submission #2143045
Source Code Expand
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}
const int N = 170000;
int x[N] , y[N] , _ , vis[N];
void add(int a,int b) {
x[_] = a , y[_++] = b;
if(b == 0) vis[a] = true;
}
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<n;i+=3) {
rep(j,0,n) if((i + j) & 1)
add(i , j);
}
if(n % 3 == 1) {
rep(j,0,n) if((n - 1 + j) & 1)
add(n - 1 , j);
}
rep(i,0,n) if(i & 1 && !vis[i])
add(i , 0);
printf("%d\n",_);
rep(i,0,_) printf("%d %d\n",x[i],y[i]);
return 0;
}
Submission Info
Submission Time
2018-02-28 20:51:07+0900
Task
J - Connected Checkerboard
User
Y_UME
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1258 Byte
Status
AC
Exec Time
23 ms
Memory
2816 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:46:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
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
2 ms
384 KB
subtask1_02.txt
AC
1 ms
256 KB
subtask1_03.txt
AC
4 ms
512 KB
subtask1_04.txt
AC
2 ms
384 KB
subtask1_05.txt
AC
8 ms
1024 KB
subtask1_06.txt
AC
12 ms
1536 KB
subtask1_07.txt
AC
3 ms
384 KB
subtask1_08.txt
AC
13 ms
1664 KB
subtask1_09.txt
AC
11 ms
1408 KB
subtask1_10.txt
AC
23 ms
2816 KB
subtask1_11.txt
AC
22 ms
2688 KB
subtask1_12.txt
AC
21 ms
2688 KB
subtask1_13.txt
AC
23 ms
2816 KB
subtask1_14.txt
AC
22 ms
2688 KB
subtask1_15.txt
AC
22 ms
2688 KB
subtask1_16.txt
AC
21 ms
2560 KB
subtask1_17.txt
AC
21 ms
2688 KB
subtask1_18.txt
AC
21 ms
2688 KB
subtask1_19.txt
AC
23 ms
2816 KB
subtask1_20.txt
AC
23 ms
2816 KB