oj.uz

답안 #923947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923947 2024-02-08T06:51:53 Z irmuun 무지개나라 (APIO17_rainbow) C++17
11 / 100
 3000 ms 2376 KB 
#include<bits/stdc++.h>
#include "rainbow.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

bool used[51][51],water[51][51];

vector<int>dx={1,-1,0,0};
vector<int>dy={0,0,1,-1};
int r1,r2,c1,c2;

bool check(int x,int y){
    if(x<r1||x>r2||y<c1||y>c2) return false;
    return true;
}

void dfs(int x,int y){
    if(!check(x,y)||water[x][y]==true||used[x][y]==true) return;
    used[x][y]=true;
    for(int i=0;i<4;i++){
        dfs(x+dx[i],y+dy[i]);
    }
}

void init(int R,int C,int sr,int sc,int M,char *S){
    water[sr][sc]=true;
    for(int i=0;i<M;i++){
        if(S[i]=='N') sr--;
        if(S[i]=='S') sr++;
        if(S[i]=='W') sc--;
        if(S[i]=='E') sc++;
        water[sr][sc]=true;
    }
}

int colour(int ar,int ac,int br,int bc){
    r1=ar;
    r2=br;
    c1=ac;
    c2=bc;
    memset(used,0,sizeof used);
    int ans=0;
    for(int i=ar;i<=br;i++){
        for(int j=ac;j<=bc;j++){
            if(!used[i][j]&&water[i][j]==false){
                ans++;
                dfs(i,j);
            }
        }
    }
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 13 ms 512 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 452 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 6 ms 480 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 13 ms 512 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 452 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 6 ms 480 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Execution timed out 3036 ms 2376 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 13 ms 512 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 452 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 6 ms 480 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Execution timed out 3036 ms 2376 KB Time limit exceeded
19 Halted 0 ms 0 KB -