oj.uz

답안 #842004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842004 2023-09-02T10:04:01 Z Tenis0206 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 767 ms 1976 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

const int nmax = 256;

std::vector<int> G[nmax + 5];

std::vector<int> longest_trip(int N, int D)
{
    int n = N;
    for(int i=0; i<n; i++)
    {
        for(int j=i+1; j<n; j++)
        {
            if(are_connected({i}, {j}))
            {
                G[i].push_back(j);
                G[j].push_back(i);
            }
        }
    }
    std::vector<int> r;
    for(int i=0;i<n;i++)
    {
        r.push_back(i);
    }
    return r;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 600 KB Output is correct
2 Correct 20 ms 476 KB Output is correct
3 Correct 125 ms 1564 KB Output is correct
4 Correct 333 ms 1820 KB Output is correct
5 Correct 730 ms 1496 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 600 KB Output is correct
2 Correct 27 ms 720 KB Output is correct
3 Correct 121 ms 1268 KB Output is correct
4 Correct 344 ms 1228 KB Output is correct
5 Correct 767 ms 1976 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1112 KB Output is correct
2 Correct 25 ms 476 KB Output is correct
3 Correct 137 ms 1312 KB Output is correct
4 Correct 372 ms 1228 KB Output is correct
5 Correct 708 ms 1496 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 704 KB Output is correct
2 Correct 24 ms 1112 KB Output is correct
3 Partially correct 129 ms 1112 KB Output is partially correct
4 Partially correct 331 ms 1368 KB Output is partially correct
5 Partially correct 702 ms 1744 KB Output is partially correct
6 Incorrect 0 ms 596 KB Incorrect
7 Halted 0 ms 0 KB -