oj.uz

답안 #57348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57348 2018-07-14T15:30:50 Z dennisstar 여왕벌 (KOI15_queen) C++11
34 / 100
 5000 ms 18336 KB 
#include <bits/stdc++.h>
int M, N;
char c[710][710][3][3][3];
int 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("%d ", 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 540 KB Output is correct
3 Correct 27 ms 1420 KB Output is correct
4 Correct 25 ms 1440 KB Output is correct
5 Correct 206 ms 5008 KB Output is correct
6 Correct 207 ms 5104 KB Output is correct
7 Correct 217 ms 5104 KB Output is correct
8 Correct 536 ms 11032 KB Output is correct
9 Correct 616 ms 11032 KB Output is correct
10 Correct 1189 ms 16544 KB Output is correct
11 Correct 1275 ms 16640 KB Output is correct
12 Correct 1181 ms 16640 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 16640 KB Output is correct
2 Correct 253 ms 16640 KB Output is correct
3 Correct 538 ms 16640 KB Output is correct
4 Correct 1190 ms 18104 KB Output is correct
5 Correct 1371 ms 18336 KB Output is correct
6 Correct 1256 ms 18336 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 18336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5073 ms 18336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 18336 KB Output is correct
2 Correct 5 ms 18336 KB Output is correct
3 Correct 3 ms 18336 KB Output is correct
4 Correct 3 ms 18336 KB Output is correct
5 Incorrect 297 ms 18336 KB Output isn't correct
6 Halted 0 ms 0 KB -