oj.uz

답안 #900535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900535 2024-01-08T12:55:04 Z abcvuitunggio 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 15 ms 1112 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> longest_trip(int N, int D){
    if (D>1){
        deque <int> q={0};
        if (!are_connected({0},{1}))
            q.push_back(2);
        q.push_back(1);
        for (int i=q.size();i<N;i++)
            if (are_connected({i},{q.front()}))
                q.push_front(i);
            else
                q.push_back(i);
        vector <int> res;
        for (int i:q)
            res.push_back(i);
        return res;
    }
    vector <int> a,b;
    a.push_back(0);
    b.push_back(1);
    for (int i=2;i<N;i++){
        if (are_connected({a.back()},{i})){
            a.push_back(i);
            continue;
        }
        if (are_connected({b.back()},{i})){
            b.push_back(i);
            continue;
        }
        reverse(b.begin(),b.end());
        for (int i:b)
            a.push_back(i);
        b={i};
    }
    if (a.size()<b.size())
        swap(a,b);
    if (!are_connected(a,b))
        return a;
    vector <int> x={0,a.size()-1},y={0,b.size()-1};
    for (int i:x)
        for (int j:y)
            if (are_connected({a[i]},{b[j]})){
                if (!i)
                    reverse(a.begin(),a.end());
                if (j)
                    reverse(b.begin(),b.end());
                for (int k:b)
                    a.push_back(k);
                return a;
            }
    int l=0,r=b.size()-1,i=-1;
    while (l<=r){
        int mid=(l+r)>>1;
        vector <int> tmp;
        for (int i=0;i<=mid;i++)
            tmp.push_back(b[i]);
        if (are_connected(a,tmp)){
            i=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    l=0,r=a.size()-1;
    int j=-1;
    while (l<=r){
        int mid=(l+r)>>1;
        vector <int> tmp;
        for (int i=0;i<=mid;i++)
            tmp.push_back(a[i]);
        if (are_connected(tmp,{b[i]})){
            j=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    vector <int> c;
    for (int k=(j+1)%a.size();c.size()<a.size();k=(k+1)%a.size())
        c.push_back(a[k]);
    for (int k=i;c.size()<a.size()+b.size();k=(k+1)%b.size())
        c.push_back(b[k]);
    return c;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:41:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   41 |     vector <int> x={0,a.size()-1},y={0,b.size()-1};
      |                       ~~~~~~~~^~
longesttrip.cpp:41:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
longesttrip.cpp:41:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   41 |     vector <int> x={0,a.size()-1},y={0,b.size()-1};
      |                                        ~~~~~~~~^~
longesttrip.cpp:41:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 4 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 756 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 6 ms 608 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 5 ms 600 KB Output is correct
23 Correct 5 ms 432 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 5 ms 344 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 8 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 5 ms 436 KB Output is correct
51 Correct 8 ms 436 KB Output is correct
52 Correct 8 ms 504 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 6 ms 340 KB Output is correct
56 Correct 5 ms 444 KB Output is correct
57 Correct 7 ms 856 KB Output is correct
58 Correct 7 ms 700 KB Output is correct
59 Correct 7 ms 608 KB Output is correct
60 Correct 7 ms 604 KB Output is correct
61 Correct 7 ms 604 KB Output is correct
62 Correct 7 ms 600 KB Output is correct
63 Correct 7 ms 436 KB Output is correct
64 Correct 7 ms 448 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 592 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 608 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 8 ms 348 KB Output is correct
36 Correct 15 ms 344 KB Output is correct
37 Correct 5 ms 448 KB Output is correct
38 Correct 7 ms 436 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 5 ms 344 KB Output is correct
41 Correct 5 ms 600 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 5 ms 344 KB Output is correct
44 Correct 5 ms 344 KB Output is correct
45 Correct 5 ms 600 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 4 ms 432 KB Output is correct
48 Correct 4 ms 344 KB Output is correct
49 Correct 6 ms 856 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Partially correct 6 ms 344 KB Output is partially correct
52 Correct 6 ms 600 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 5 ms 344 KB Output is correct
57 Partially correct 6 ms 344 KB Output is partially correct
58 Partially correct 6 ms 600 KB Output is partially correct
59 Partially correct 7 ms 344 KB Output is partially correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 6 ms 600 KB Output is correct
62 Correct 5 ms 604 KB Output is correct
63 Partially correct 6 ms 600 KB Output is partially correct
64 Partially correct 7 ms 856 KB Output is partially correct
65 Partially correct 7 ms 608 KB Output is partially correct
66 Partially correct 7 ms 856 KB Output is partially correct
67 Partially correct 7 ms 600 KB Output is partially correct
68 Partially correct 8 ms 612 KB Output is partially correct
69 Partially correct 7 ms 600 KB Output is partially correct
70 Partially correct 7 ms 444 KB Output is partially correct
71 Correct 7 ms 612 KB Output is correct
72 Partially correct 7 ms 600 KB Output is partially correct
73 Partially correct 8 ms 600 KB Output is partially correct
74 Partially correct 7 ms 600 KB Output is partially correct
75 Partially correct 9 ms 600 KB Output is partially correct
76 Partially correct 8 ms 600 KB Output is partially correct
77 Correct 6 ms 604 KB Output is correct
78 Partially correct 6 ms 1112 KB Output is partially correct
79 Correct 6 ms 436 KB Output is correct
80 Partially correct 7 ms 600 KB Output is partially correct
81 Partially correct 7 ms 600 KB Output is partially correct
82 Partially correct 9 ms 856 KB Output is partially correct