oj.uz

답안 #72328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72328 2018-08-26T07:11:24 Z cat > /dev/null(#2231, lobo_prix, jms100300, enochjung) 마법 다우징 (FXCUP3_magic) C++17
25 / 100
 3 ms 380 KB 
#include "dowsing.h"
#include<set>
#include<ctime>
#include<cstdio>
#include<cstdlib>
using namespace std;

void FindTreasure(int N) {
    bool t11 = Detect(1, 1), t12 = Detect(1, 2), t21 = Detect(2, 1);

    if (!t11 && t12 && t21) {
        if (Detect(1, 3))
            Report(1, 1);
        else
            Report(2, 2);
        return;
    }
    if (t11 && t12 && !t21) {
        for (int i = 1; i <= N; i ++)
            if (!Detect(1, i)) {
                Report(1,i);
                return;
            }
    }
    if (t11 && t21 && !t12) {
        for (int i = 1; i <= N; i ++)
            if (!Detect(i, 1)) {
                Report(i,1);
                return;
            }
    }

    if (t11 && !t12 && !t21) {
        if (Detect(1, 3)) {
            Report(1, 2);
            return;
        }
        if (Detect(3, 1)) {
            Report(2, 1);
            return;
        }
    }

    srand(time(NULL));
    set<int> rest, rest2;

    for (int i = 1; i <= N; i ++)
        rest.insert(i), rest2.insert(i);

    int row, col;

    while (true) {
        int ra = ((long long)rand() * rand()) % rest.size();

        int val; 
        for (int item : rest) {
            val = item;
            if (!ra)
                break;
            ra--;
        }

        if (Detect(1, val)) {
            col = val;
            break;
        }

        rest.erase(val);
    }


    while (true) {
        int ra = ((long long)rand() * rand()) % rest2.size();

        int val; 
        for (int item : rest2) {
            val = item;
            if (!ra)
                break;
            ra--;
        }

        if (Detect(val,1)) {
            row = val;
            break;
        }

        rest2.erase(val);
    }

    Report(row, col);
    return;
}

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Correct : C = 4
2 Correct 2 ms 376 KB Correct : C = 5
3 Partially correct 3 ms 376 KB Partially correct : C = 201
4 Partially correct 3 ms 376 KB Partially correct : C = 201
5 Partially correct 3 ms 376 KB Partially correct : C = 203
6 Partially correct 3 ms 376 KB Partially correct : C = 203
7 Partially correct 3 ms 376 KB Partially correct : C = 200
8 Partially correct 3 ms 380 KB Partially correct : C = 201
9 Partially correct 3 ms 376 KB Partially correct : C = 200
10 Correct 3 ms 376 KB Correct : C = 77
11 Correct 3 ms 376 KB Correct : C = 84
12 Correct 3 ms 376 KB Correct : C = 60