oj.uz

답안 #841053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841053 2023-09-01T07:36:42 Z MrBrionix 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 16 ms 440 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

bool are_connected(std::vector<int> A, std::vector<int> B);

void add(vector<int> &a,vector<int> &b){
    reverse(a.begin(),a.end());
    for(auto i : b)a.push_back(i);
}

bool query(vector<int> &a,vector<int> &b,int l1,int r1,int l2,int r2){
    vector<int> tmp1,tmp2;
    for(int i=l1;i<=r1;i++)tmp1.push_back(a[i]);
    for(int i=l2;i<=r2;i++)tmp2.push_back(b[i]);
    
    return are_connected(tmp1,tmp2);
}

vector<int> longest_trip(int N, int D)
{
    
    queue<vector<int>> q;
    for(int i=0;i<N;i++){
        q.push({i});
    }
    
    while(q.size()>2){
        auto a = q.front();
        q.pop();
        auto b = q.front();
        q.pop();
        auto c = q.front();
        q.pop();
        
        if(are_connected({*a.begin()},{*b.begin()})){
            ;
        }else if(are_connected({*a.begin()},{*c.begin()})){
            swap(b,c);
        }else{
            swap(a,c);
        }
        
        add(a,b);
        q.push(a);
        q.push(c);
    }
    
    auto a = q.front();
    q.pop();
    auto b = q.front();
    q.pop();
    
    if(!are_connected(a,b)){
        if(a.size()>b.size())return a;
        else return b;
    }else{
        
        int l1 = *a.begin(), r1 = a.back();
        int l2 = *b.begin(), r2 = b.back();
        
        if(are_connected({l1},{l2})){
            add(a,b);
            return a;
        }
        if(are_connected({l1},{r2})){
            reverse(b.begin(),b.end());
            add(a,b);
            return a;
        }
        if(are_connected({l2},{r1})){
            reverse(a.begin(),a.end());
            add(a,b);
            return a;
        }
        
        
        int low = -1, up = a.size()-1;
        
        while(up-low>1){
            int mid = (up+low)/2;
            
            if(query(a,b,0,mid,0,b.size()-1)){
                up=mid;
            }else{
                low=mid;
            }
        }
        
        int ind = up;
        
        low = -1, up = b.size()-1;
        while(up-low>1){
            int mid = (up+low)/2;
            
            if(query(a,b,ind,ind,0,mid)){
                up=mid;
            }else{
                low=mid;
            }
        }
        
        
        for(int i=0;i<ind;i++){
            a.push_back(*a.begin());
            a.erase(a.begin());
        }
        
        for(int i=0;i<up;i++){
            b.push_back(*b.begin());
            b.erase(b.begin());
        }
        
        add(a,b);
        return a;
    }
}

/*
  1
  5 1
  1
  1 1
  0 0 1
  0 0 0 1
  
  static inline constexpr int maxNumberOfCalls = 32640;
  static inline constexpr int maxTotalNumberOfCalls = 150000;
  static inline constexpr int maxTotalNumberOfLandmarksInCalls = 1500000;
  static int call_counter = 0;
  static int total_call_counter = 0;
  static int landmark_counter = 0;
  
  static int C, N, D;
  static std::vector<std::vector<int>> U;
  static std::vector<bool> present;
  
  static inline void protocol_violation(std::string message)
  {
  printf("Protocol Violation: %s\n", message.c_str());
  exit(0);
  }
  
  bool are_connected(std::vector<int> A, std::vector<int> B)
  {
  ++call_counter;
  ++total_call_counter;
  if (call_counter > maxNumberOfCalls || total_call_counter > maxTotalNumberOfCalls)
  {
  protocol_violation("too many calls");
  }
  
  int nA = A.size(), nB = B.size();
  landmark_counter += nA + nB;
  if (landmark_counter > maxTotalNumberOfLandmarksInCalls)
  {
  protocol_violation("too many elements");
  }
  
  if (nA == 0 || nB == 0)
  {
  protocol_violation("invalid array");
  }
  for (int i = 0; i < nA; ++i)
  {
  if (A[i] < 0 || N <= A[i])
  {
  protocol_violation("invalid array");
  }
  if (present[A[i]])
  {
  protocol_violation("invalid array");
  }
  present[A[i]] = true;
  }
  for (int i = 0; i < nA; ++i)
  {
  present[A[i]] = false;
  }
  for (int i = 0; i < nB; ++i)
  {
  if (B[i] < 0 || N <= B[i])
  {
  protocol_violation("invalid array");
  }
  if (present[B[i]])
  {
  protocol_violation("invalid array");
  }
  present[B[i]] = true;
  }
  for (int i = 0; i < nB; ++i)
  {
  present[B[i]] = false;
  }
  
  for (int i = 0; i < nA; ++i)
  {
  for (int j = 0; j < nB; ++j)
  {
  if (A[i] == B[j])
  {
  protocol_violation("non-disjoint arrays");
  }
  }
  }
  
  for (int i = 0; i < nA; ++i)
  {
  for (int j = 0; j < nB; ++j)
  {
  if (U[std::max(A[i], B[j])][std::min(A[i], B[j])] == 1)
  {
  return true;
  }
  }
  }
  
  return false;
  }
  
  
  int main()
  {
  assert(1 == scanf("%d", &C));
  int maximumCalls = 0;
  for (int c = 0; c < C; ++c)
  {
  call_counter = 0;
  assert(2 == scanf("%d %d", &N, &D));
  
  present.assign(N, false);
  U.resize(N);
  for (int i = 1; i < N; ++i)
  {
  U[i].resize(i);
  for (int j = 0; j < i; ++j)
  {
  assert(1 == scanf("%d", &U[i][j]));
  }
  }
  
  for (int i = 2; i < N; ++i)
  {
  for (int j = 1; j < i; ++j)
  {
  for (int k = 0; k < j; ++k)
  {
  if (U[i][j] + U[i][k] + U[j][k] < D)
  {
  printf("Insufficient Density\n");
  exit(0);
  }
  }
  }
  }
  
  std::vector<int> t = longest_trip(N, D);
  int l = t.size();
  printf("%d\n", l);
  for (int i = 0; i < l; ++i)
  {
  printf(i == 0 ? "%d" : " %d", t[i]);
  }
  printf("\n");
  printf("%d chiamate\n", call_counter);
  
  maximumCalls = std::max(maximumCalls, call_counter);
  call_counter = 0;
  }
  printf("%d max chiamate\n", maximumCalls);
  
  return 0;
  }
 */

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 8 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 8 ms 260 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 16 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 13 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 8 ms 332 KB Output is correct
23 Correct 9 ms 336 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 8 ms 412 KB Output is correct
26 Correct 8 ms 208 KB Output is correct
27 Correct 6 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 12 ms 208 KB Output is correct
30 Correct 9 ms 208 KB Output is correct
31 Correct 6 ms 208 KB Output is correct
32 Correct 10 ms 208 KB Output is correct
33 Correct 9 ms 304 KB Output is correct
34 Correct 10 ms 208 KB Output is correct
35 Correct 9 ms 208 KB Output is correct
36 Correct 7 ms 336 KB Output is correct
37 Correct 9 ms 208 KB Output is correct
38 Correct 10 ms 336 KB Output is correct
39 Correct 11 ms 380 KB Output is correct
40 Correct 11 ms 208 KB Output is correct
41 Correct 12 ms 336 KB Output is correct
42 Correct 10 ms 208 KB Output is correct
43 Correct 11 ms 316 KB Output is correct
44 Correct 15 ms 324 KB Output is correct
45 Correct 11 ms 208 KB Output is correct
46 Correct 9 ms 208 KB Output is correct
47 Correct 10 ms 208 KB Output is correct
48 Correct 10 ms 208 KB Output is correct
49 Correct 10 ms 208 KB Output is correct
50 Correct 11 ms 208 KB Output is correct
51 Correct 11 ms 208 KB Output is correct
52 Correct 13 ms 208 KB Output is correct
53 Correct 10 ms 316 KB Output is correct
54 Correct 10 ms 208 KB Output is correct
55 Correct 10 ms 208 KB Output is correct
56 Correct 8 ms 336 KB Output is correct
57 Correct 8 ms 324 KB Output is correct
58 Correct 14 ms 208 KB Output is correct
59 Correct 11 ms 324 KB Output is correct
60 Correct 13 ms 312 KB Output is correct
61 Correct 11 ms 336 KB Output is correct
62 Correct 7 ms 332 KB Output is correct
63 Correct 16 ms 320 KB Output is correct
64 Correct 10 ms 320 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 9 ms 308 KB Output is correct
5 Correct 8 ms 208 KB Output is correct
6 Correct 13 ms 208 KB Output is correct
7 Correct 11 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 10 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 336 KB Output is correct
19 Correct 10 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 7 ms 208 KB Output is correct
22 Correct 11 ms 208 KB Output is correct
23 Correct 12 ms 208 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 10 ms 208 KB Output is correct
26 Correct 10 ms 332 KB Output is correct
27 Correct 11 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 8 ms 368 KB Output is correct
30 Correct 9 ms 208 KB Output is correct
31 Correct 10 ms 208 KB Output is correct
32 Correct 9 ms 208 KB Output is correct
33 Correct 8 ms 208 KB Output is correct
34 Correct 12 ms 208 KB Output is correct
35 Correct 10 ms 208 KB Output is correct
36 Correct 14 ms 208 KB Output is correct
37 Correct 9 ms 208 KB Output is correct
38 Correct 16 ms 208 KB Output is correct
39 Correct 11 ms 300 KB Output is correct
40 Correct 8 ms 208 KB Output is correct
41 Correct 8 ms 208 KB Output is correct
42 Correct 8 ms 208 KB Output is correct
43 Correct 9 ms 328 KB Output is correct
44 Correct 8 ms 324 KB Output is correct
45 Correct 6 ms 372 KB Output is correct
46 Correct 9 ms 208 KB Output is correct
47 Correct 7 ms 208 KB Output is correct
48 Correct 10 ms 328 KB Output is correct
49 Correct 11 ms 324 KB Output is correct
50 Partially correct 11 ms 208 KB Output is partially correct
51 Partially correct 11 ms 336 KB Output is partially correct
52 Partially correct 12 ms 336 KB Output is partially correct
53 Partially correct 12 ms 208 KB Output is partially correct
54 Partially correct 14 ms 208 KB Output is partially correct
55 Partially correct 10 ms 336 KB Output is partially correct
56 Correct 9 ms 336 KB Output is correct
57 Correct 6 ms 440 KB Output is correct
58 Partially correct 11 ms 208 KB Output is partially correct
59 Partially correct 12 ms 324 KB Output is partially correct
60 Partially correct 10 ms 208 KB Output is partially correct
61 Partially correct 13 ms 336 KB Output is partially correct
62 Correct 8 ms 336 KB Output is correct
63 Correct 10 ms 336 KB Output is correct
64 Correct 11 ms 336 KB Output is correct
65 Partially correct 12 ms 320 KB Output is partially correct
66 Partially correct 11 ms 324 KB Output is partially correct
67 Partially correct 13 ms 208 KB Output is partially correct
68 Partially correct 11 ms 208 KB Output is partially correct
69 Partially correct 16 ms 208 KB Output is partially correct
70 Partially correct 10 ms 336 KB Output is partially correct
71 Correct 9 ms 336 KB Output is correct
72 Correct 9 ms 336 KB Output is correct
73 Partially correct 11 ms 336 KB Output is partially correct
74 Partially correct 11 ms 208 KB Output is partially correct
75 Partially correct 15 ms 324 KB Output is partially correct
76 Partially correct 10 ms 336 KB Output is partially correct
77 Correct 9 ms 332 KB Output is correct
78 Correct 11 ms 332 KB Output is correct
79 Partially correct 10 ms 332 KB Output is partially correct
80 Partially correct 11 ms 336 KB Output is partially correct
81 Partially correct 15 ms 324 KB Output is partially correct
82 Partially correct 10 ms 208 KB Output is partially correct