oj.uz

답안 #846629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846629 2023-09-08T07:49:34 Z ttamx 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 9 ms 852 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>

using namespace std;

int bsearch(vector<int> vec,vector<int> fixed){
    int l=0,r=vec.size()-1;
    while(l<r){
        int m=(l+r)/2;
        vector<int> res;
        for(int i=l;i<=m;i++)res.emplace_back(vec[i]);
        if(are_connected(res,fixed))r=m;
        else l=m+1;
    }
    return l;
}

vector<int> longest_trip(int N, int D)
{
    if(D==3){
        vector<int> ans(N);
        iota(ans.begin(),ans.end(),0);
        return ans;
    }
    if(D==2){
        deque<int> path;
        for(int i=0;i<3;i++)path.emplace_back(i);
        for(int i=1;i<3;i++){
            if(!are_connected({i-1},{i})){
                swap(path[0],path[i-1]);
                swap(path[2],path[i]);
                break;
            }
        }
        for(int i=3;i<N;i++){
            if(are_connected({i},{path[0]})){
                path.emplace_front(i);
            }else{
                path.emplace_back(i);
            }
        }
        vector<int> ans;
        for(auto x:path)ans.emplace_back(x);
        return ans;
    }
    vector<int> path[2];
    for(int i=0;i<2;i++)path[i].emplace_back(i);
    for(int i=2;i<N;i++){
        if(are_connected({i},{path[0].back()})){
            path[0].emplace_back(i);
            continue;
        }
        if(are_connected({i},{path[1].back()})){
            path[1].emplace_back(i);
            continue;
        }
        while(!path[1].empty()){
            path[0].emplace_back(path[1].back());
            path[1].pop_back();
        }
        path[1].emplace_back(i);
    }
    if(path[0].size()<path[1].size())swap(path[0],path[1]);
    if(!are_connected(path[0],path[1]))return path[0];
    if(are_connected({path[0][0]},{path[1][0]})){
        reverse(path[1].begin(),path[1].end());
        auto ans=path[1];
        for(auto x:path[0])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0][0]},{path[1].back()})){
        auto ans=path[1];
        for(auto x:path[0])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0].back()},{path[1][0]})){
        auto ans=path[0];
        for(auto x:path[1])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0].back()},{path[1].back()})){
        auto ans=path[0];
        reverse(path[1].begin(),path[1].end());
        for(auto x:path[1])ans.emplace_back(x);
        return ans;
    }
    int id0=bsearch(path[0],path[1]);
    int id1=bsearch(path[1],{path[0][id0]});
    vector<int> ans;
    for(int i=0;i<path[0].size();i++)ans.emplace_back((id0+i+1)%path[0].size());
    for(int i=0;i<path[1].size();i++)ans.emplace_back((id1+i)%path[1].size());
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:90:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for(int i=0;i<path[0].size();i++)ans.emplace_back((id0+i+1)%path[0].size());
      |                 ~^~~~~~~~~~~~~~~
longesttrip.cpp:91:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for(int i=0;i<path[1].size();i++)ans.emplace_back((id1+i)%path[1].size());
      |                 ~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 4 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 5 ms 600 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 5 ms 600 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 5 ms 436 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 4 ms 440 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -