oj.uz

답안 #846710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846710 2023-09-08T09:30:45 Z Trisanu_Das 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 282 ms 344 KB 
#include "longesttrip.h" 
#include <bits/stdc++.h>
using namespace std;
 
vector<int> longest_trip(int N, int D) {
    vector<int> ans = {0};
    bool vis[N];
    vis[0] = true;
    bool adj[N][N];
    for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(i != j) adj[i][j] = adj[j][i] = are_connected({i}, {j});
    while (true) {
        if (ans.size() == N) return ans;
        bool flag = false;
        for (int i = 0; i < N && !flag; i++) {
            if (!vis[i]) {
                if (adj[ans[0]][i]) {
                    ans.insert(ans.begin(), i);
                    flag = true;
                    vis[i] = true;
                    break;
                }
                if (adj[ans.back()][i]) {
                    ans.push_back(i);
                    flag = true;
                    vis[i] = true;
                    break;
                }
                for (int j = 0; j < ans.size(); j++) {
                    if (adj[ans[j]][i]) {
                        vector<int> new_path;
                        new_path.insert(new_path.end(), ans.begin() + j + 1, ans.end());
                        new_path.insert(new_path.end(), ans.begin(), ans.begin() + j + 1);
                        ans = new_path;
                        ans.push_back(i);
                        flag = true;
                        vis[i] = true;
                        break;
                    }
                }
            }
        }
        if (!flag) {
            if (ans.size() >= (N - ans.size())) return ans;
            ans.clear();
            for (int i = 0; i < N; ++i) if (!vis[i]) ans.push_back(i);
            return ans;
        }
    }
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:12:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   12 |         if (ans.size() == N) return ans;
      |             ~~~~~~~~~~~^~~~
longesttrip.cpp:28:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                 for (int j = 0; j < ans.size(); j++) {
      |                                 ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 175 ms 344 KB too many calls
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 344 KB Output is correct
2 Correct 53 ms 344 KB Output is correct
3 Correct 282 ms 344 KB Output is correct
4 Incorrect 168 ms 344 KB Incorrect
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -