oj.uz

답안 #1059785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059785 2024-08-15T08:11:07 Z Huseyn123 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 126 ms 664 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); 
        b.push_back(1);
        for(int i=2;i<N;i++){
            if(are_connected({a.back()},{i})){
                a.push_back(i);
            }
            else if(are_connected({b.back()},{i})){
                b.push_back(i);
            }
            else{
                reverse(b.begin(),b.end()); 
                for(auto x:b){
                    a.push_back(x);
                }
                b.clear();
                b.push_back(i);
            }
        }
        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 0 ms 344 KB Output is correct
2 Correct 11 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 1 ms 344 KB Output is correct
4 Correct 0 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 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 4 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 5 ms 344 KB Output is correct
10 Correct 7 ms 448 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 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 15 ms 344 KB Output is correct
3 Correct 18 ms 344 KB Output is correct
4 Correct 21 ms 344 KB Output is correct
5 Correct 19 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 18 ms 344 KB Output is correct
8 Correct 21 ms 344 KB Output is correct
9 Correct 26 ms 344 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 14 ms 344 KB Output is correct
12 Correct 39 ms 344 KB Output is correct
13 Correct 39 ms 412 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 17 ms 344 KB Output is correct
16 Correct 36 ms 344 KB Output is correct
17 Correct 49 ms 344 KB Output is correct
18 Correct 38 ms 344 KB Output is correct
19 Correct 25 ms 344 KB Output is correct
20 Correct 56 ms 592 KB Output is correct
21 Correct 37 ms 412 KB Output is correct
22 Correct 77 ms 416 KB Output is correct
23 Correct 50 ms 412 KB Output is correct
24 Correct 51 ms 420 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 18 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 16 ms 344 KB Output is correct
29 Correct 13 ms 344 KB Output is correct
30 Correct 14 ms 344 KB Output is correct
31 Correct 45 ms 600 KB Output is correct
32 Correct 50 ms 344 KB Output is correct
33 Correct 15 ms 344 KB Output is correct
34 Correct 27 ms 344 KB Output is correct
35 Correct 35 ms 344 KB Output is correct
36 Correct 17 ms 344 KB Output is correct
37 Correct 61 ms 344 KB Output is correct
38 Correct 96 ms 344 KB Output is correct
39 Correct 103 ms 344 KB Output is correct
40 Correct 87 ms 420 KB Output is correct
41 Correct 103 ms 344 KB Output is correct
42 Correct 121 ms 344 KB Output is correct
43 Correct 98 ms 664 KB Output is correct
44 Correct 104 ms 444 KB Output is correct
45 Correct 15 ms 356 KB Output is correct
46 Correct 14 ms 356 KB Output is correct
47 Correct 19 ms 356 KB Output is correct
48 Correct 19 ms 356 KB Output is correct
49 Correct 15 ms 352 KB Output is correct
50 Correct 17 ms 356 KB Output is correct
51 Correct 33 ms 352 KB Output is correct
52 Correct 63 ms 444 KB Output is correct
53 Correct 20 ms 356 KB Output is correct
54 Correct 28 ms 440 KB Output is correct
55 Correct 50 ms 448 KB Output is correct
56 Correct 15 ms 344 KB Output is correct
57 Correct 37 ms 592 KB Output is correct
58 Correct 75 ms 600 KB Output is correct
59 Correct 89 ms 420 KB Output is correct
60 Correct 115 ms 424 KB Output is correct
61 Correct 112 ms 424 KB Output is correct
62 Correct 114 ms 440 KB Output is correct
63 Correct 126 ms 344 KB Output is correct
64 Correct 101 ms 592 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 16 ms 344 KB Output is correct
5 Partially correct 17 ms 344 KB Output is partially correct
6 Correct 14 ms 344 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 26 ms 344 KB Output is correct
9 Partially correct 20 ms 344 KB Output is partially correct
10 Partially correct 26 ms 440 KB Output is partially correct
11 Partially correct 25 ms 344 KB Output is partially correct
12 Partially correct 34 ms 344 KB Output is partially correct
13 Partially correct 33 ms 432 KB Output is partially correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Incorrect 3 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -