Submission #72174

#	Time	Username	Problem	Language	Result	Execution time	Memory
72174		신딩없는 신딩팀 (#118)	마법 다우징 (FXCUP3_magic)	C++17	100 / 100	3 ms	376 KiB

dowsing

#include "dowsing.h"

#include <stdio.h>
#include <vector>
using namespace std;

vector<int> chk;

void FindTreasure(int N) {
	for(int i=1;i<N;i++){
        if(Detect(i,i)) chk.push_back(i);
	}

    if(chk.empty()){
        for(int i=1;i<N;i+=2){
            if(Detect(i,i+1)){
                if(i>1){
                    if(Detect(i-1,i)) Report(i,i);
                    else Report(i+1,i+1);
                }
                else{
                    if(Detect(i+1,i+2)) Report(i+1,i+1);
                    else Report(i,i);
                }
                return;
            }
        }
        Report(N,N);
        return;
    }
	if(chk.size()==1) chk.push_back(N);

	if(chk[0]!=1 && chk[1]!=1){
        if(Detect(chk[0],1)) Report(chk[0],chk[1]);
        else Report(chk[1],chk[0]);
	}
	else if(chk[0]!=2 && chk[1]!=2){
        if(Detect(chk[0],2)) Report(chk[0],chk[1]);
        else Report(chk[1],chk[0]);
	}
	else{
        if(Detect(chk[0],3)) Report(chk[0],chk[1]);
        else Report(chk[1],chk[0]);
	}
}

• Subtask 1: 100 / 100