oj.uz

답안 #1060359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060359 2024-08-15T13:21:41 Z Huseyn123 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 148 ms 668 KB 
#include "longesttrip.h"
#include <bits/stdc++.h> 
using namespace std; 
vector<int> a,b,c; 
bool f(int x,int l,int r){
    vector<int> d;
    for(int i=l;i<=r;i++){
        d.push_back(b[i]);
    }
    if((int)d.size()==0){
        return false;
    }
    return are_connected({a[x]},d);
}
vector<int> longest_trip(int N, int D){ 
    a.clear(); 
    b.clear(); 
    c.clear();
    vector<int> res;
    if(D==3){ 
        for(int i=0;i<N;i++){
            res.push_back(i);
        }
    }
    else if(D==2){
        set<int> c;
        for(int i=1;i<N;i++){
            c.insert(i);
        }
        res.push_back(0);
        for(int i=0;i<N-1;i++){
            auto it=c.begin();
            if(are_connected({res.back()},{*it})){
                res.push_back(*it);
            }
            else{
                ++it; 
                if(it==c.end()){
                    reverse(res.begin(),res.end());
                    --it; 
                    res.push_back(*it);
                }
                else{
                    res.push_back(*it);
                }
            }
            c.erase(*it);
        }
    }
    else{ 
        a.push_back(0); 
        for(int i=1;i<N;i++){
            bool ok1=are_connected({a.back()},{i});
            bool ok2=true;
            if((int)b.size()>0){
                ok2=are_connected({b.back()},{i});
            }
            if(ok1 && ok2){
                reverse(b.begin(),b.end());
                a.push_back(i);
                for(auto x:b){
                    a.push_back(x);
                }
                b.clear();
            }
            else if(ok1){
                a.push_back(i);
            }
            else if(ok2){
                b.push_back(i);
            }
            else{
                reverse(b.begin(),b.end()); 
                for(auto x:b){
                    a.push_back(x);
                }
                b.clear();
                b.push_back(i);
            }
        }
        if(b.size()==0){
            return a;
        }
        for(int i=0;i<(int)a.size();i++){
            int sz=(int)b.size();
            int sz1=(int)a.size();
            int l,r,mid; 
            l=0;
            r=sz-1;
            while(l<r){
                mid=(l+r+1)/2;
                if(f(i,mid,sz-1)){
                    l=mid;
                }
                else{
                    r=mid-1;
                }
            }
            if(f(i,l,sz-1) && l+1+max(i+1,sz1-i)>(int)c.size()){
                c.clear();
                for(int j=0;j<=l;j++){
                    c.push_back(b[j]);
                }
                if(i+1>sz1-i){
                    for(int j=i;j>=0;j--){
                        c.push_back(a[j]);
                    }
                }
                else{
                    for(int j=i;j<sz1;j++){
                        c.push_back(a[j]);
                    }
                }
            }
            l=0;
            r=sz-1;
            while(l<r){
                mid=(l+r)/2;
                if(f(i,0,mid)){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            if(f(i,0,l) && sz-l+max(i+1,sz1-i)>(int)c.size()){
                c.clear();
                for(int j=sz-1;j>=l;j--){
                    c.push_back(b[j]);
                }
                if(i+1>sz1-i){
                    for(int j=i;j>=0;j--){
                        c.push_back(a[j]);
                    }
                }
                else{
                    for(int j=i;j<sz1;j++){
                        c.push_back(a[j]);
                    }
                }
            }
        }
        if((int)a.size()>(int)b.size()){
            res=a;
        }
        else{
            res=b;
        }
        if((int)c.size()>(int)res.size()){
            res=c;
        }
    }
    return res;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #3
25.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 6 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 8 ms 548 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 15 ms 344 KB Output is correct
15 Correct 16 ms 344 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 8 ms 432 KB Output is correct
20 Correct 17 ms 600 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 8 ms 596 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 19 ms 344 KB Output is correct
26 Correct 18 ms 340 KB Output is correct
27 Correct 15 ms 344 KB Output is correct
28 Correct 23 ms 344 KB Output is correct
29 Correct 23 ms 344 KB Output is correct
30 Correct 19 ms 344 KB Output is correct
31 Correct 45 ms 440 KB Output is correct
32 Correct 52 ms 344 KB Output is correct
33 Correct 14 ms 344 KB Output is correct
34 Correct 39 ms 344 KB Output is correct
35 Correct 50 ms 344 KB Output is correct
36 Correct 19 ms 344 KB Output is correct
37 Correct 70 ms 344 KB Output is correct
38 Correct 107 ms 344 KB Output is correct
39 Correct 115 ms 344 KB Output is correct
40 Correct 131 ms 412 KB Output is correct
41 Correct 121 ms 344 KB Output is correct
42 Correct 148 ms 344 KB Output is correct
43 Correct 107 ms 412 KB Output is correct
44 Correct 125 ms 344 KB Output is correct
45 Correct 11 ms 344 KB Output is correct
46 Correct 13 ms 344 KB Output is correct
47 Correct 21 ms 344 KB Output is correct
48 Correct 11 ms 344 KB Output is correct
49 Correct 16 ms 344 KB Output is correct
50 Correct 23 ms 344 KB Output is correct
51 Correct 49 ms 344 KB Output is correct
52 Correct 74 ms 344 KB Output is correct
53 Correct 28 ms 344 KB Output is correct
54 Correct 37 ms 440 KB Output is correct
55 Correct 57 ms 600 KB Output is correct
56 Correct 35 ms 416 KB Output is correct
57 Correct 62 ms 416 KB Output is correct
58 Correct 68 ms 440 KB Output is correct
59 Correct 108 ms 420 KB Output is correct
60 Correct 119 ms 424 KB Output is correct
61 Correct 128 ms 424 KB Output is correct
62 Correct 134 ms 436 KB Output is correct
63 Correct 113 ms 668 KB Output is correct
64 Correct 127 ms 424 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Correct 8 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 8 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 18 ms 344 KB Output is correct
15 Correct 23 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -