oj.uz

Submission #201026

# Submission time Handle Problem Language Result Execution time Memory
201026 2020-02-09T06:26:19 Z dennisstar 여왕벌 (KOI15_queen) C++17
34 / 100
 5000 ms 33356 KB 
#include <bits/stdc++.h>
int M, N;
char c[710][710][3][3][3];
long long sum[710][710];
int main()
{
	int i, j, k;
	scanf("%d %d", &M, &N);
	for (i=1; i<M; i++) for (j=1; j<M; j++) for (k=0; k<27; k++) scanf(" %c", &c[i][j][k/9][(k%9)/3][k%3]);
	int x, y, z;
	for (i=1; i<M; i++) for (j=1; j<M; j++) for (x=0; x<3; x++) for (y=0; y<3; y++)
		for (z=0; z<3; z++) {
			if (c[i][j][x][y][z]=='L') c[i][j][x][y][z]=x;
			else if (c[i][j][x][y][z]=='D') c[i][j][x][y][z]=y;
			else c[i][j][x][y][z]=z;
		}
	int l, r, lp, rp;
	for (i=0; i<N; i++) {
		scanf("%d %d %d", &x, &y, &z);
		l=(x<M?0:(x-M+1));
		r=((x+y)<M?0:(x+y-M+1));
		sum[0][l]++, sum[0][r]++;
		for (j=1; j<M; j++) {
			lp=l,rp=r;
			if (x+j==M){
				l++;
				while(c[j][l][0][1][1]==0&&l<r) l++;
			}
			else if (l&&l!=r&&l<M) {
				if(c[j][l][0][x+j==M?1:0][1]==0) {
					l++;
					while(c[j][l][0][1][1]==0&&l<r) l++;
				}
			}
			if (x+y+j==M){
				r++;
				if (y==0) {while(c[j][r][0][2][2]==0&&r<M)r++; l=r;}
				else {while(c[j][r][1][2][2]==1&&r<M) r++;}
			}
			else if (r&&r<M) {
				if (l==r&&c[j][l][0][1][2]==1){
					r++;
					while(c[j][r][1][2][2]==1&&r<M) r++;
				}
				else if (l==r) {
					if (c[j][r][0][1][2]==0) {
						r++;
						while(c[j][r][0][2][2]==0&&r<M) r++;
						l=r;
					}
				}
				else {
					if (r==1) while(c[j][r][1][2][2]==1&&r<M)r++;
					else if (c[j][r][1][1][2]==1) {
						r++;
						while(c[j][r][1][2][2]==1&&r<M) r++;
					}
				}
			}
			sum[j][l]++, sum[j][r]++;
		}
	}
	for (i=0; i<M; i++) {
		for (j=1; j<M; j++) {
			sum[i][j]+=sum[i][j-1];
		}
	}
	for (i=0; i<M; i++) {
		for (j=0; j<M; j++) {
			printf("%lld ", sum[i][j]+1);
		}
		puts("");
	}
	return 0;
}

Compilation message

queen.cpp: In function 'int main()':
queen.cpp:17:12: warning: variable 'lp' set but not used [-Wunused-but-set-variable]
  int l, r, lp, rp;
            ^~
queen.cpp:17:16: warning: variable 'rp' set but not used [-Wunused-but-set-variable]
  int l, r, lp, rp;
                ^~
queen.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &M, &N);
  ~~~~~^~~~~~~~~~~~~~~~~
queen.cpp:9:68: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i=1; i<M; i++) for (j=1; j<M; j++) for (k=0; k<27; k++) scanf(" %c", &c[i][j][k/9][(k%9)/3][k%3]);
                                                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
queen.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &x, &y, &z);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 24 ms 1784 KB Output is correct
4 Correct 35 ms 1784 KB Output is correct
5 Correct 193 ms 8164 KB Output is correct
6 Correct 177 ms 8188 KB Output is correct
7 Correct 184 ms 8184 KB Output is correct
8 Correct 497 ms 19064 KB Output is correct
9 Correct 509 ms 18984 KB Output is correct
10 Correct 969 ms 31672 KB Output is correct
11 Correct 1042 ms 31612 KB Output is correct
12 Correct 1004 ms 31636 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 528 KB Output is correct
2 Correct 220 ms 8476 KB Output is correct
3 Correct 374 ms 13620 KB Output is correct
4 Correct 2707 ms 33272 KB Output is correct
5 Correct 1553 ms 33356 KB Output is correct
6 Correct 1283 ms 33264 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5093 ms 24008 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 372 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Incorrect 355 ms 6240 KB Output isn't correct
6 Halted 0 ms 0 KB -