제출 #12913

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
12913		baneling100	탐사 (KOI13_probe)	C++98	14.63 / 19	2036 ms	668 KiB

probe

#include <stdio.h>

int K, N, Probe[41][1001][3], Len[41], Ans[41];

int backTrack(int now) {

    int i, OK;

    if(now>K)
        return 1;
    else {
        Ans[now]=Ans[now-1]+1;
        OK=1;
        for(i=1 ; i<=Len[now] && OK ; i++) {
            if(now==Probe[now][i][2]) {
                if(Ans[now]-Ans[Probe[now][i][0]]!=Probe[now][i][1])
                    OK=0;
            }
            else
                if(Ans[now]-Ans[Probe[now][i][0]]>Probe[now][i][1])
                    OK=0;
        }
        if(OK)
            if(backTrack(now+1))
                return 1;
        Ans[now]=Ans[now-1];
        OK=1;
        for(i=1 ; i<=Len[now] && OK ; i++) {
            if(now==Probe[now][i][2]) {
                if(Ans[now]-Ans[Probe[now][i][0]]!=Probe[now][i][1])
                    OK=0;
            }
            else
                if(Ans[now]-Ans[Probe[now][i][0]]>Probe[now][i][1])
                    OK=0;
        }
        if(OK)
            if(backTrack(now+1))
                return 1;
    }
    return 0;
}

int main(void) {

    int i, j, in1, in2, in3;

    scanf("%d %d",&K,&N);
    for(i=1 ; i<=N ; i++) {
        scanf("%d %d %d",&in1,&in2,&in3);
        for(j=in1 ; j<=in2 ; j++) {
            Len[j]++;
            Probe[j][Len[j]][0]=in1-1;
            Probe[j][Len[j]][1]=in3;
            Probe[j][Len[j]][2]=in2;
        }
    }
    if(backTrack(1))
        for(i=1 ; i<=K ; i++) {
            if(Ans[i]-Ans[i-1])
                printf("#");
            else
                printf("-");
        }
    else
        printf("NONE");

    return 0;
}

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

probe.cpp: In function 'int main()':
probe.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&K,&N);
     ~~~~~^~~~~~~~~~~~~~~
probe.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&in1,&in2,&in3);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2.47 / 2.47
• Subtask 2: 2.09 / 2.09
• Subtask 3: 1.33 / 1.33
• Subtask 4: 5.13 / 5.13
• Subtask 5: 3.61 / 3.61
• Subtask 6: 0 / 4.37