oj.uz

답안 #980641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980641 2024-05-12T09:39:22 Z oleh1421 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 9 ms 692 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
bool connected(vector<int>A,vector<int>B){
    if (A.empty() || B.empty()) return false;
    sort(A.begin(),A.end());
    sort(B.begin(),B.end());
    A.erase(unique(A.begin(),A.end()),A.end());
    B.erase(unique(B.begin(),B.end()),B.end());
    return are_connected(A,B);
}
std::vector<int> longest_trip(int N, int D)
{
    vector<int>A={0},B;
    for (int i=1;i<N;i++){
        if (connected({A.back()},{i})){
            A.push_back(i);
        } else {
            if (B.empty() || connected({B.back()},{i})){
                B.push_back(i);
            } else {
                reverse(B.begin(),B.end());
                for (auto i:B) A.push_back(i);
                B={i};
            }
        }
    }
    if (B.empty()) return A;
    if (!connected(A,B)){
        if (A.size()>B.size()) return A;
        else return B;
    }
    if (connected({A[0],A.back()},{B[0],B.back()})){
        if (connected({A[0]},{B[0],B.back()})){
            if (connected({A[0]},{B[0]})){
                reverse(B.begin(),B.end());
                for (auto i:A){
                    B.push_back(i);
                }
                return B;
            } else {
                for (auto i:A){
                    B.push_back(i);
                }
                return B;
            }
        } else {
            if (connected({A.back()},{B[0]})){
                for (auto i:B){
                    A.push_back(i);
                }
                return A;
            } else {
                reverse(B.begin(),B.end());
                for (auto i:B){
                    A.push_back(i);
                }
                return A;
            }
        }
    }

    vector<int>rem,A0,B0;
    {
        int pos=0;
        for (int i=8;i>=0;i--){
            pos+=(1<<i);
            if (pos>=A.size()){
                pos-=(1<<i);
                continue;
            }
            vector<int>C;
            for (int j=0;j<pos;j++) C.push_back(A[j]);
            if (connected(C,B)){
                pos-=(1<<i);
            }
        }
        rem=A;
        A={A[pos]};
        swap(A,B);
    }
    A0=rem;
    {
        int pos=0;
        for (int i=8;i>=0;i--){
            pos+=(1<<i);
            if (pos>=A.size()){
                pos-=(1<<i);
                continue;
            }
            vector<int>C;
            for (int j=0;j<pos;j++) C.push_back(A[j]);
            if (connected(C,B)){
                pos-=(1<<i);
            }
        }
        rem=A;
        A={A[pos]};
        swap(A,B);
    }

    B0=rem;

    int posA=-1,posB=-1;
    for (int i=0;i<A.size();i++){
        if (A0[i]==A[0]) posA=i;
    }
    for (int i=0;i<B.size();i++){
        if (B0[i]==B[0]) posB=i;
    }
    vector<int>ans;
    for (int i=posA+1;i<A.size();i++){
        ans.push_back(A0[i]);
    }
    for (int i=0;i<=posA;i++){
        ans.push_back(A0[i]);
    }
    for (int i=posB;i<B.size();i++){
        ans.push_back(B0[i]);
    }
    for (int i=0;i<posB;i++){
        ans.push_back(B0[i]);
    }
    for (int i=1;i<ans.size();i++){
        if (!connected({ans[i-1]},{ans[i]})) exit(1);
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:68:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             if (pos>=A.size()){
      |                 ~~~^~~~~~~~~~
longesttrip.cpp:87:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |             if (pos>=A.size()){
      |                 ~~~^~~~~~~~~~
longesttrip.cpp:105:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for (int i=0;i<A.size();i++){
      |                  ~^~~~~~~~~
longesttrip.cpp:108:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for (int i=0;i<B.size();i++){
      |                  ~^~~~~~~~~
longesttrip.cpp:112:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for (int i=posA+1;i<A.size();i++){
      |                       ~^~~~~~~~~
longesttrip.cpp:118:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     for (int i=posB;i<B.size();i++){
      |                     ~^~~~~~~~~
longesttrip.cpp:124:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     for (int i=1;i<ans.size();i++){
      |                  ~^~~~~~~~~~~

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 5 ms 344 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 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 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 4 ms 440 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 5 ms 436 KB Output is correct
14 Correct 7 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 5 ms 344 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 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 436 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Correct 5 ms 692 KB Output is correct
14 Correct 7 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 -