oj.uz

답안 #72174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72174 2018-08-26T05:45:57 Z 신딩없는 신딩팀(#2212, willi19, andy627, maruii) 마법 다우징 (FXCUP3_magic) C++17
100 / 100
 3 ms 376 KB 
#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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB Correct : C = 4
2 Correct 2 ms 376 KB Correct : C = 3
3 Correct 3 ms 376 KB Correct : C = 148
4 Correct 3 ms 376 KB Correct : C = 99
5 Correct 3 ms 376 KB Correct : C = 150
6 Correct 3 ms 376 KB Correct : C = 100
7 Correct 3 ms 376 KB Correct : C = 148
8 Correct 3 ms 376 KB Correct : C = 150
9 Correct 3 ms 376 KB Correct : C = 150
10 Correct 3 ms 376 KB Correct : C = 150
11 Correct 3 ms 376 KB Correct : C = 149
12 Correct 3 ms 376 KB Correct : C = 148