oj.uz

답안 #841151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841151 2023-09-01T09:53:59 Z MrBrionix 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 22 ms 480 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);
}

bool comp1(vector<int> &a,vector<int> &b){
    return a.size()<b.size();
}

bool comp2(vector<int> &a,vector<int> &b){
    return a.size()>b.size();
}

bool comp(pair<int,vector<int>> &a,pair<int,vector<int>> &b){
    return a.first<b.first;
}

mt19937 rng((uint64_t) chrono::duration_cast<chrono::
    nanoseconds>(chrono::high_resolution_clock::now()
        .time_since_epoch()).count());

vector<int> longest_trip(int N, int D)
{
    srand(time(NULL));
    deque<pair<int,vector<int>>> q;
    
    
    for(int i=0;i<N;i++){
        q.push_back({0,{i}});
    }
    shuffle(q.begin(),q.end(),rng);
    
    int cont=0;
    
    while(q.size()>2){
        
        
        sort(q.begin(),q.end(),comp);
        //sort(q.begin()+1,q.end(),comp2);
        //shuffle(q.begin()+1,q.begin()+3,rng);
        auto a = q.front().second;
        auto ca = q.front().first;
        q.pop_front();
        auto b = q.front().second;
        auto cb = q.front().first;
        q.pop_front();
        auto c = q.front().second;
        auto cc = q.front().first;
        q.pop_front();
        
        //if(rng()%2)reverse(a.begin(),a.end());
        //if(rng()%2)reverse(b.begin(),b.end());
        //if(rng()%2)reverse(c.begin(),c.end());
        
        swap(a,c);
        
        if(are_connected({*a.begin()},{*b.begin()})){
            add(a,b);
            shuffle(q.begin(),q.end(),rng);
            q.push_back({max(ca,cb),a});
            q.push_front({cc,c});
            cont++;
        }else if(are_connected({*a.begin()},{*c.begin()})){
            add(a,c);
            shuffle(q.begin(),q.end(),rng);
            q.push_back({max(ca,cc),a});
            q.push_front({cb+1,b});
            cont+=2;
        }else{
            add(b,c);
            shuffle(q.begin(),q.end(),rng);
            q.push_back({max(cb,cc),b});
            q.push_front({ca+1,a});
            cont+=2;
        }
    }
    
    
    assert(cont<400);
    auto a = q.front().second;
    q.pop_front();
    auto b = q.front().second;
    q.pop_front();
    
    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==r1) ? vector<int>{l1} : vector<int>{l1,r1},(l2 == r2) ? vector<int>{l2} : vector<int>{l2,r2})){
            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;
            }
            
            reverse(a.begin(),a.end());
            reverse(b.begin(),b.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 0 ms 208 KB Output is correct
2 Correct 4 ms 320 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 8 ms 384 KB Output is correct
5 Correct 14 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 10 ms 316 KB Output is correct
4 Correct 11 ms 324 KB Output is correct
5 Correct 11 ms 356 KB Output is correct
6 Correct 19 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 12 ms 324 KB Output is correct
10 Correct 13 ms 340 KB Output is correct
11 Correct 12 ms 336 KB Output is correct
12 Correct 13 ms 352 KB Output is correct
13 Correct 14 ms 388 KB Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 10 ms 328 KB Output is correct
5 Correct 13 ms 348 KB Output is correct
6 Correct 12 ms 208 KB Output is correct
7 Correct 12 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 12 ms 336 KB Output is correct
11 Correct 13 ms 340 KB Output is correct
12 Correct 13 ms 336 KB Output is correct
13 Correct 13 ms 336 KB Output is correct
14 Correct 7 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 12 ms 208 KB Output is correct
18 Correct 12 ms 308 KB Output is correct
19 Correct 11 ms 324 KB Output is correct
20 Correct 14 ms 316 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 10 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Correct 12 ms 312 KB Output is correct
27 Correct 11 ms 312 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 13 ms 336 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 10 ms 208 KB Output is correct
32 Correct 13 ms 208 KB Output is correct
33 Correct 14 ms 208 KB Output is correct
34 Correct 10 ms 208 KB Output is correct
35 Correct 12 ms 208 KB Output is correct
36 Correct 13 ms 208 KB Output is correct
37 Correct 12 ms 312 KB Output is correct
38 Correct 13 ms 208 KB Output is correct
39 Correct 14 ms 208 KB Output is correct
40 Correct 13 ms 324 KB Output is correct
41 Correct 11 ms 208 KB Output is correct
42 Correct 14 ms 208 KB Output is correct
43 Correct 13 ms 336 KB Output is correct
44 Correct 16 ms 336 KB Output is correct
45 Correct 12 ms 360 KB Output is correct
46 Correct 12 ms 348 KB Output is correct
47 Correct 17 ms 344 KB Output is correct
48 Correct 16 ms 332 KB Output is correct
49 Correct 14 ms 332 KB Output is correct
50 Correct 13 ms 336 KB Output is correct
51 Correct 17 ms 332 KB Output is correct
52 Correct 16 ms 328 KB Output is correct
53 Correct 19 ms 336 KB Output is correct
54 Correct 22 ms 324 KB Output is correct
55 Correct 19 ms 316 KB Output is correct
56 Correct 13 ms 336 KB Output is correct
57 Correct 12 ms 328 KB Output is correct
58 Correct 19 ms 336 KB Output is correct
59 Correct 21 ms 336 KB Output is correct
60 Correct 20 ms 208 KB Output is correct
61 Correct 16 ms 336 KB Output is correct
62 Correct 13 ms 348 KB Output is correct
63 Correct 13 ms 464 KB Output is correct
64 Correct 15 ms 464 KB Output is correct
65 Correct 17 ms 336 KB Output is correct
66 Correct 17 ms 336 KB Output is correct
67 Partially correct 17 ms 340 KB Output is partially correct
68 Correct 17 ms 328 KB Output is correct
69 Runtime error 6 ms 448 KB Execution killed with signal 6
70 Halted 0 ms 0 KB -