oj.uz

답안 #57360

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57360 2018-07-14T16:16:30 Z wilwxk 무지개나라 (APIO17_rainbow) C++11
0 / 100
 7 ms 924 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=2e5+5;
int v[3][MAXN], cor[3][3][MAXN];
int erro[4][MAXN], soma[4][MAXN];
int kc[3][3];
int n, m;

void dfs(int k, int ind, int val) {
    for(int i=ind; i<=m; i++) {
        if(v[k][i]) return;
        cor[1][k][i]=val;
    }
}
void dfs2(int ox, int oy, int val) {
    cor[2][ox][oy]=val; int outro=((ox)%2)+1;
    if(cor[2][outro][oy]==0&&v[outro][oy]!=1) dfs2(outro, oy, val);
    if(oy+1>m) return;
    if(cor[2][ox][oy+1]==0&&v[ox][oy+1]!=1) dfs2(ox, oy+1, val);
}

void init(int R, int C, int sr, int sc, int M, char *S) {
    int cx=sr, cy=sc; n=R; m=C;
    v[cx][cy]=1;
    for(int i=0; i<M; i++) {
        if(S[i]=='N') cx--;
        if(S[i]=='S') cx++;
        if(S[i]=='W') cy--;
        if(S[i]=='E') cy++;
        v[cx][cy]=1;
    }

    kc[1][1]=1; kc[1][2]=1; kc[2][2]=1;
    for(int i=1; i<=C; i++) {
        for(int k=1; k<=2; k++) {
            if(cor[1][k][i]==0&&!v[k][i]) dfs(k, i, kc[1][k]++);
            if(cor[2][k][i]==0&&!v[k][i]) dfs2(k, i, kc[2][2]++);
        }
        soma[1][i]=max(cor[1][1][i], soma[1][i-1]);
        soma[2][i]=max(cor[1][2][i], soma[2][i-1]);
        soma[3][i]=max(soma[3][i-1], max(cor[2][1][i], cor[2][2][i]));

        erro[1][i]=v[1][i]; if(erro[1][i-1]&&erro[1][i]) erro[1][i]+=erro[1][i-1];
        erro[2][i]=v[2][i]; if(erro[2][i-1]&&erro[2][i]) erro[2][i]+=erro[2][i-1];
        erro[3][i]=v[1][i]&&v[2][i]; if(erro[3][i-1]&&erro[3][i]) erro[3][i]+=erro[3][i-1];
    }

    for(int k=1; k<=2; k++) {
        //for(int i=1; i<=m; i++) printf("%d ", [2][k][i]); printf("\n");
    }

}

int colour(int ar, int ac, int br, int bc) {
    if(ar==br) {
        int resp=soma[ar][bc]-soma[ar][ac]+1;
        if(v[1][ac]) resp--;
        return resp;
    }
    else {
        int resp=soma[3][bc]-soma[3][ac]+1;
        if(v[1][ac]&&v[2][ac]) resp--;
        return resp;
    }

    return 0;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Runtime error 7 ms 924 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 Runtime error 4 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -