답안 #1061310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1061310	2024-08-16T07:58:18 Z	noyancanturk	가장 긴 여행 (IOI23_longesttrip)	C++17	70 / 100	20 ms	688 KB

longesttrip

#include "longesttrip.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

int n,d;

vector<int>getslice(int l,int r,deque<int>&v){
  vector<int>res;
  for(int i=l;i<=r;i++){
    res.pb(v[i]);
  }
  return res;
}

vector<int>longest_trip(int N,int D){
  n=N,d=D;
  deque<int>trip1,trip2;
  trip1.pb(0);
  for(int i=1;i<n;i++){
    bool ok=are_connected({trip1.back()},{i});
    if(ok){
      trip1.pb(i);
    }else if(!trip2.size()){
      trip2.pb(i);
    }else{
      ok=are_connected({trip2.back()},{i});
      if(ok){
        trip2.pb(i);
      }else{
        while(trip2.size()){
          trip1.pb(trip2.back());
          trip2.pop_back();
        }
        trip2.pb(i);
      }
    }
  }
  if(!trip2.size())return vector<int>(trip1.begin(),trip1.end());
  if(!are_connected(vector<int>(trip1.begin(),trip1.end()),vector<int>(trip2.begin(),trip2.end()))){
    if(trip1.size()<trip2.size())swap(trip1,trip2);
    return vector<int>(trip1.begin(),trip1.end());
  }
  if(are_connected({trip1.front()},{trip2.front()})){
    vector<int>ans;
    for(int i=trip1.size()-1;0<=i;i--){
      ans.pb(trip1[i]);
    }
    for(int i:trip2){
      ans.pb(i);
    }
    return ans;
  }
  if(are_connected({trip1.back()},{trip2.front()})){
    vector<int>ans;
    for(int i:trip1){
      ans.pb(i);
    }
    for(int i:trip2){
      ans.pb(i);
    }
    return ans;
  }
  if(are_connected({trip1.back()},{trip2.back()})){
    vector<int>ans;
    for(int i:trip1){
      ans.pb(i);
    }
    for(int i=trip2.size()-1;0<=i;i--){
      ans.pb(trip2[i]);
    }
    return ans;
  }
  int ans1=-1;
  {
    int l=0,r=trip1.size()-1;
    while(l<=r){
      int mid=(l+r)>>1;
      bool ok=are_connected(getslice(l,mid,trip1),vector<int>(trip2.begin(),trip2.end()));
      if(ok){
        ans1=mid;
        r=mid-1;
      }else{
        l=mid+1;
      }
    }
  }
  assert(ans1!=-1);
  int ans2=-1;
  {
    int l=0,r=trip2.size()-1;
    while(l<=r){
      int mid=(l+r)>>1;
      bool ok=are_connected(getslice(l,mid,trip2),{trip1[ans1]});
      if(ok){
        ans2=mid;
        r=mid-1;
      }else{
        l=mid+1;
      }
    }
  }
  assert(ans2!=-1);
  vector<int>ans;
  for(int i=ans1+1;i<trip1.size();i++){
    ans.pb(trip1[i]);
  }
  for(int i=0;i<=ans1;i++){
    ans.pb(trip1[i]);
  }
  for(int i=ans2;i<trip2.size();i++){
    ans.pb(trip2[i]);
  }
  for(int i=0;i<ans2;i++){
    ans.pb(trip2[i]);
  }
  assert(ans.size()==n);
  for(int i=0;i<n-1;i++){
    assert(are_connected({ans[i]},{ans[i+1]}));
  }
  return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:107:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |   for(int i=ans1+1;i<trip1.size();i++){
      |                    ~^~~~~~~~~~~~~
longesttrip.cpp:113:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int i=ans2;i<trip2.size();i++){
      |                  ~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from longesttrip.cpp:3:
longesttrip.cpp:119:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  119 |   assert(ans.size()==n);
      |          ~~~~~~~~~~^~~

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

Subtask #2

10.0 / 10.0

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

Subtask #4

30.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 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	7 ms	384 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	436 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	6 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	7 ms	344 KB	Output is correct
15	Correct	8 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	4 ms	344 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Correct	6 ms	344 KB	Output is correct
21	Correct	7 ms	344 KB	Output is correct
22	Correct	10 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	4 ms	344 KB	Output is correct
26	Correct	6 ms	344 KB	Output is correct
27	Correct	8 ms	344 KB	Output is correct
28	Correct	9 ms	344 KB	Output is correct
29	Correct	6 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	9 ms	344 KB	Output is correct
33	Correct	12 ms	344 KB	Output is correct
34	Correct	10 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	13 ms	344 KB	Output is correct
37	Correct	7 ms	344 KB	Output is correct
38	Correct	13 ms	344 KB	Output is correct
39	Correct	20 ms	344 KB	Output is correct
40	Correct	15 ms	344 KB	Output is correct
41	Correct	11 ms	344 KB	Output is correct
42	Correct	15 ms	344 KB	Output is correct
43	Correct	6 ms	596 KB	Output is correct
44	Correct	10 ms	344 KB	Output is correct
45	Correct	5 ms	344 KB	Output is correct
46	Correct	10 ms	344 KB	Output is correct
47	Correct	9 ms	600 KB	Output is correct
48	Correct	6 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	6 ms	344 KB	Output is correct
51	Partially correct	7 ms	344 KB	Output is partially correct
52	Correct	7 ms	344 KB	Output is correct
53	Correct	13 ms	344 KB	Output is correct
54	Correct	9 ms	344 KB	Output is correct
55	Correct	8 ms	600 KB	Output is correct
56	Correct	4 ms	436 KB	Output is correct
57	Partially correct	6 ms	344 KB	Output is partially correct
58	Partially correct	11 ms	344 KB	Output is partially correct
59	Partially correct	8 ms	344 KB	Output is partially correct
60	Correct	9 ms	344 KB	Output is correct
61	Correct	8 ms	440 KB	Output is correct
62	Partially correct	7 ms	344 KB	Output is partially correct
63	Partially correct	8 ms	344 KB	Output is partially correct
64	Partially correct	9 ms	344 KB	Output is partially correct
65	Partially correct	10 ms	596 KB	Output is partially correct
66	Partially correct	14 ms	688 KB	Output is partially correct
67	Partially correct	16 ms	344 KB	Output is partially correct
68	Partially correct	12 ms	344 KB	Output is partially correct
69	Partially correct	11 ms	344 KB	Output is partially correct
70	Partially correct	13 ms	344 KB	Output is partially correct
71	Partially correct	15 ms	344 KB	Output is partially correct
72	Partially correct	17 ms	344 KB	Output is partially correct
73	Partially correct	15 ms	344 KB	Output is partially correct
74	Partially correct	13 ms	344 KB	Output is partially correct
75	Partially correct	13 ms	428 KB	Output is partially correct
76	Partially correct	13 ms	344 KB	Output is partially correct
77	Partially correct	10 ms	344 KB	Output is partially correct
78	Partially correct	12 ms	344 KB	Output is partially correct
79	Partially correct	8 ms	344 KB	Output is partially correct
80	Partially correct	20 ms	600 KB	Output is partially correct
81	Partially correct	14 ms	600 KB	Output is partially correct
82	Partially correct	18 ms	600 KB	Output is partially correct