제출 #981346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981346		pcc	무지개나라 (APIO17_rainbow)	C++17	0 / 100	4 ms	7320 KiB

rainbow

#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

const int mxn = 2e5+10;

int arr[3][mxn];
int pref[mxn];
int row[3][mxn];

void init(int R, int C, int sr, int sc, int M, char *S) {
	memset(arr,0,sizeof(arr));
	pii now = pii(sr,sc);
	arr[now.fs][now.sc] = -1;
	for(int i = 0;i<M;i++){
		if(S[i] == 'N')now.fs--;
		else if(S[i] == 'S')now.fs++;
		else if(S[i] == 'E')now.sc++;
		else if(S[i] == 'W')now.sc--;
		arr[now.fs][now.sc] = -1;
	}
	/*
	for(int i = 1;i<=R;i++){
		for(int j = 1;j<=C;j++)cerr<<setw(2)<<arr[i][j]<<' ';cerr<<endl;
	}cerr<<endl;

   */
	for(int i = 1;i<=C;i++){
		pref[i] = pref[i-1];
		row[1][i] = row[1][i-1];
		row[2][i] = row[2][i-1];
		if(arr[1][i] == -1&&arr[1][i-1] != -1)row[1][i]++;
		if(arr[2][i] == -1&&arr[2][i-1] != -1)row[2][i]++;
		if(arr[1][i] == arr[2][i]&&arr[1][i] == -1&&(arr[1][i-1] != -1||arr[2][i-1] != -1))pref[i]++;
	}
	for(int i = 1;i<=C;i++)cerr<<pref[i]<<' ';cerr<<endl;
	return;
}

int colour(int ar, int ac, int br, int bc) {
	if(ar == br){
		int cnt = row[ar][bc]-row[ar][ac-1]-1;
		if(arr[ar][ac] != -1)cnt++;
		if(arr[br][bc] != -1)cnt++;
		cnt = max(0,cnt);
		return cnt;
	}
	else{
		int cnt = pref[bc]-pref[ac-1]-1;
		if(arr[ar][0] != -1||arr[ar][1] != -1)cnt++;
		if(arr[br][0] != -1||arr[br][1] != -1)cnt++;
		cnt = max(0,cnt);
		return cnt;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

rainbow.cpp: In function 'void init(int, int, int, int, int, char*)':
rainbow.cpp:40:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   40 |  for(int i = 1;i<=C;i++)cerr<<pref[i]<<' ';cerr<<endl;
      |  ^~~
rainbow.cpp:40:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |  for(int i = 1;i<=C;i++)cerr<<pref[i]<<' ';cerr<<endl;
      |                                            ^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26