# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12883 | baneling100 | 보도블록 (KOI11_block) | C++98 | 4 ms | 1088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int M, N;
int main(void) {
int i, j;
scanf("%d %d",&M,&N);
printf("%d\n",2*M*N);
if(M%2) {
if(N%2) {
for(i=2 ; i<=N ; i++) {
if(i%2)
printf("1 %d 0\n1 %d 1\n",i,i);
else
printf("1 %d 0\n2 %d 0\n1 %d 1\n",i,i,i);
}
printf("2 %d 0\n2 %d 1\n3 %d 0\n3 %d 1\n3 %d 1\n2 %d 1\n3 %d 0\n",N,N,N,N,N-1,N-1,N-1);
for(i=N-2 ; i>=2 ; i--) {
if(i%2)
printf("3 %d 1\n3 %d 0\n2 %d 1\n2 %d 0\n",i,i,i,i);
else
printf("2 %d 1\n3 %d 1\n3 %d 0\n",i,i,i);
}
for(i=4 ; i<=M ; i++) {
if(i%2)
for(j=N ; j>=2 ; j--) {
if((i+j)%2)
printf("%d %d 1\n%d %d 0\n",i,j,i,j);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |