Submission #2152140
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define se second #define fi first #define mk(a,b) make_pair(a,b) int N; set<pair<int,int> > st; int main() { scanf("%d",&N); for(int i = 1; i < N; i += 3) { for(int j = 1 - (i % 2); j < N; j += 2) { st.insert(mk(j,i)); printf("%d %d\n",j,i); } } for(int i = 0; i < N; i++) { if(i % 2 == 0)continue; if(st.count(mk(0,i)))continue; printf("%d %d\n",0,i); st.insert(mk(0,i)); } for(int i = 0; i < N; i++) { if((i + N - 1) % 2 == 0)continue; if(st.count(mk(i,N - 1)))continue; printf("%d %d\n",i,N - 1); st.insert(mk(i,N - 1)); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | J - Connected Checkerboard |
User | unit |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 784 Byte |
Status | WA |
Exec Time | 53 ms |
Memory | 9344 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:19: 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 | 0 / 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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 3 ms | 640 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 7 ms | 1280 KB |
subtask1_04.txt | WA | 3 ms | 640 KB |
subtask1_05.txt | WA | 16 ms | 3072 KB |
subtask1_06.txt | WA | 26 ms | 4864 KB |
subtask1_07.txt | WA | 5 ms | 896 KB |
subtask1_08.txt | WA | 27 ms | 5120 KB |
subtask1_09.txt | WA | 23 ms | 4352 KB |
subtask1_10.txt | WA | 53 ms | 9216 KB |
subtask1_11.txt | WA | 49 ms | 8960 KB |
subtask1_12.txt | WA | 50 ms | 8704 KB |
subtask1_13.txt | WA | 50 ms | 9216 KB |
subtask1_14.txt | WA | 52 ms | 8960 KB |
subtask1_15.txt | WA | 48 ms | 8704 KB |
subtask1_16.txt | WA | 47 ms | 8576 KB |
subtask1_17.txt | WA | 47 ms | 8704 KB |
subtask1_18.txt | WA | 47 ms | 8704 KB |
subtask1_19.txt | WA | 50 ms | 9216 KB |
subtask1_20.txt | WA | 51 ms | 9344 KB |