oj.uz

답안 #738309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738309 2023-05-08T12:21:05 Z myrcella 무지개나라 (APIO17_rainbow) C++17
11 / 100
 15 ms 852 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "rainbow.h"

const int maxn = 55;

const int dx[4] = {0,-1,1,0}, dy[4] = {1,0,0,-1};
int grid[maxn][maxn];
int r,c;

void init(int R, int C, int sr, int sc, int M, char *S) {
	r = R, c = C;
	grid[sr][sc] = 1;
	rep(i,0,M) {
		if (S[i]=='S') sr++;
		else if (S[i]=='E') sc++;
		else if (S[i]=='W') sc--;
		else sr--;
		grid[sr][sc] = 1;
	}
}

bool vis[maxn][maxn];

int colour(int ar, int ac, int br, int bc) {
	int cnt = 0;
	rep(i,ar,br+1) rep(j,ac,bc+1) vis[i][j] = grid[i][j];
	rep(i,ar,br+1)
		rep(j,ac,bc+1) {
			if (vis[i][j]) continue;
			cnt++;
			vis[i][j] = 1;
			queue <pii> q;
			q.push({i,j});
			while (!q.empty()) {
				int x = q.front().fi, y = q.front().se;
				q.pop();
				rep(k,0,4) {
					int nx = x+dx[k], ny = y+dy[k];
					if (nx<ar or nx>br or ny<ac or ny>bc or vis[nx][ny]) continue;
					vis[nx][ny] = 1;
					q.push({nx,ny});
				}
			}
		}
    return cnt;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 312 KB Output is correct
2 Correct 6 ms 408 KB Output is correct
3 Correct 15 ms 356 KB Output is correct
4 Correct 15 ms 348 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 13 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 9 ms 352 KB Output is correct
14 Correct 13 ms 360 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 1 ms 696 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 672 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 312 KB Output is correct
2 Correct 6 ms 408 KB Output is correct
3 Correct 15 ms 356 KB Output is correct
4 Correct 15 ms 348 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 13 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 9 ms 352 KB Output is correct
14 Correct 13 ms 360 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Runtime error 2 ms 852 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 312 KB Output is correct
2 Correct 6 ms 408 KB Output is correct
3 Correct 15 ms 356 KB Output is correct
4 Correct 15 ms 348 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 13 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 9 ms 352 KB Output is correct
14 Correct 13 ms 360 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Runtime error 2 ms 852 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -