oj.uz

답안 #42949

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42949 2018-03-06T19:36:36 Z MatheusLealV Simurgh (IOI17_simurgh) C++14
0 / 100
 5 ms 480 KB 
#include <bits/stdc++.h>
#include "simurgh.h"
using namespace std;

int n, m;

vector<int> find_roads(int n_, vector<int> u, vector<int> v)
{
    n = n_;

    m = u.size();

    for(int mask = 0; mask < (1<<m); mask ++)
    {
        vector<int> aux;

        for(int i = 0; i < m; i++)
        {
            if(mask & (1<<i))
            {
                aux.push_back(i);
            }
        }

        if(aux.size() == n - 1 && count_common_roads(aux) == n - 1) return aux; 
    }
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:25:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(aux.size() == n - 1 && count_common_roads(aux) == n - 1) return aux; 
                       ^
simurgh.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 480 KB correct
2 Incorrect 5 ms 480 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -