oj.uz

답안 #252927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252927 2020-07-26T13:23:28 Z Sugardorj 무지개나라 (APIO17_rainbow) C++14
11 / 100
 3000 ms 4344 KB 
#include <bits/stdc++.h>
#include <rainbow.h>

using namespace std;
long long b[323567],c[323456],a[323][456],tt,d[334564],e[456744];
long long x,m,n,t,k,l;
long long i , j,r,s,y,z;
string p;
queue<pair<long long,long long>> q,qq;

void init(int R, int C, int sr, int sc, int M, char *S) {
    n=R;
    m=C;
    x=sr;
    y=sc;
    l=M;
    tt=1456785678;
    a[x][y]=tt;
    for (i = 0; i<l; i ++){
        if (S[i]=='N')
            x--;
        if (S[i]=='S')
            x++;
        if (S[i]=='W')
            y--;
        if (S[i]=='E')
            y++;
        a[x][y]=tt;
    }
}
int colour(int ar, int ac, int br, int bc) {
    x=ar;
    y=ac;
    l=br;
    r=bc;
        //cin >> x>>y>>l>>r;
        s=0;
        i=1;
        for (j = x; j<=l; j++){
            for (z = y; z<=r;z++){
                if (a[j][z]==1)
                    a[j][z]=0;
            }
        }
        for (j = x; j<=l; j++){
            for (z = y; z<=r;z++){
                if (a[j][z]>= i){
                    continue;
                }
                s++;
                q=qq;
                q.push({j,z});
                while(q.size()){
                    long long xx=q.front().first;
                    long long yy=q.front().second;
                    q.pop();
                    if (xx+1<=l&&a[xx+1][yy]<i){
                        q.push({xx+1,yy});
                        a[xx+1][yy]=i;    
                    }
                    if (xx-1>=x&&a[xx-1][yy]<i){
                        a[xx-1][yy]=i;    
                        
                        q.push({xx-1,yy});}
                    if (yy+1<=r&&a[xx][yy+1]<i){
                        a[xx][yy+1]=i;    
                        q.push({xx,yy+1});}
                    if (yy-1>=y&&a[xx][yy-1]<i){
                        a[xx][yy-1]=i;    
                        q.push({xx,yy-1});}
                }
            }
        }
        return s;
        //cout <<s<<endl;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Execution timed out 3072 ms 2296 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Runtime error 2 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

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

Subtask #5
0 / 26.0

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