oj.uz

Submission #1016996

# Submission time Handle Problem Language Result Execution time Memory
1016996 2024-07-08T16:54:16 Z Andrey Longest Trip (IOI23_longesttrip) C++17
15 / 100
 15 ms 776 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;

deque<int> haha[500];

int n;

void merge(int a, int b) {
    for(int i = 0; i < haha[b].size(); i++) {
        haha[a].push_front(haha[b][i]);
    }
    haha[b].clear();
}

int dude(int p1, int p2) {
    vector<int> a(0);
    vector<int> b(0);
    for(int i = 0; i < haha[p2].size(); i++) {
        b.push_back(haha[p2][i]);
    }
    int l = 0,r = haha[p1].size()-1;
    while(l < r) {
        int m = (l+r)/2;
        a.clear();
        for(int i = l; i <= m; i++) {
            a.push_back(haha[p1][i]);
        }
        if(are_connected(a,b)) {
            r = m;
        }
        else {
            l = m+1;
        }
    }
    return l;
}

std::vector<int> longest_trip(int N, int D)
{
    n = N;
    for(int i = 0; i < n; i++) {
        haha[i].clear();
        haha[i].push_back(i);
    }
    for(int i = 0; i < n-2; i++) {
        vector<int> wut(0);
        for(int j = 0; j < n; j++) {
            if(haha[j].size() > 0) {
                wut.push_back(j);
                if(wut.size() == 3) {
                    break;
                }
            }
        }
        if(are_connected({haha[wut[0]][0]},{haha[wut[1]][0]})) {
            merge(wut[0],wut[1]);
        }
        else if(are_connected({haha[wut[0]][0]},{haha[wut[2]][0]})) {
            merge(wut[0],wut[2]);
        }
        else {
            merge(wut[1],wut[2]);
        }
    }
    int p1 = -1,p2;
    for(int i = 0; i < n; i++) {
        if(haha[i].size() > 0) {
            if(p1 == -1) {
                p1 = i;
            }
            else {
                p2 = i;
            }
        }
    }
    vector<int> ans(0);
    if(are_connected({haha[p1][0]},{haha[p2][0]})) {
        for(int i = haha[p1].size()-1; i >= 0; i--) {
            ans.push_back(haha[p1][i]);
        }
        for(int i = 0; i < haha[p2].size(); i++) {
            ans.push_back(haha[p2][i]);
        }
        return ans;
    }
    if(are_connected({haha[p1][haha[p1].size()-1]},{haha[p2][0]})) {
        for(int i = 0; i < haha[p1].size(); i++) {
            ans.push_back(haha[p1][i]);
        }
        for(int i = 0; i < haha[p2].size(); i++) {
            ans.push_back(haha[p2][i]);
        }
        return ans;
    }
    if(are_connected({haha[p1][0]},{haha[p2][haha[p2].size()-1]})) {
        for(int i = 0; i < haha[p1].size(); i++) {
            ans.push_back(haha[p1][i]);
        }
        for(int i = haha[p2].size()-1; i >= 0; i--) {
            ans.push_back(haha[p2][i]);
        }
        return ans;
    }
    vector<int> a(0);
    vector<int> b(0);
    for(int i = 0; i < haha[p1].size(); i++) {
        a.push_back(haha[p1][i]);
    }
    for(int i = 0; i < haha[p2].size(); i++) {
        b.push_back(haha[p2][i]);
    }
    if(true) {
        if(a.size() > b.size()) {
            return a;
        }
        else {
            return b;
        }
    }
    int x1 = dude(p1,p2);
    int x2 = dude(p2,p1);
    for(int i = x1+1; i < haha[p1].size(); i++) {
        ans.push_back(haha[p1][i]);
    }
    for(int i = 0; i <= x1; i++) {
        ans.push_back(haha[p1][i]);
    }
    for(int i = x2; i < haha[p2].size(); i++) {
        ans.push_back(haha[p2][i]);
    }
    for(int i = 0; i < x2; i++) {
        ans.push_back(haha[p2][i]);
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'void merge(int, int)':
longesttrip.cpp:10:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i = 0; i < haha[b].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'int dude(int, int)':
longesttrip.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < haha[p2].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:82:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |         for(int i = 0; i < haha[p2].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:88:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for(int i = 0; i < haha[p1].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:91:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int i = 0; i < haha[p2].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:97:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int i = 0; i < haha[p1].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:107:22: 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 = 0; i < haha[p1].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:110:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for(int i = 0; i < haha[p2].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:123:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for(int i = x1+1; i < haha[p1].size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for(int i = x2; i < haha[p2].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 596 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 7 ms 600 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 8 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 7 ms 600 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 6 ms 600 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 772 KB Output is correct
11 Correct 7 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 5 ms 600 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 6 ms 600 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 9 ms 600 KB Output is correct
6 Correct 8 ms 600 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 10 ms 600 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 11 ms 600 KB Output is correct
18 Correct 6 ms 772 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 6 ms 776 KB Output is correct
21 Correct 6 ms 600 KB Output is correct
22 Correct 7 ms 772 KB Output is correct
23 Correct 6 ms 600 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 9 ms 600 KB Output is correct
26 Correct 8 ms 600 KB Output is correct
27 Correct 8 ms 600 KB Output is correct
28 Correct 7 ms 600 KB Output is correct
29 Correct 8 ms 600 KB Output is correct
30 Correct 8 ms 600 KB Output is correct
31 Correct 14 ms 600 KB Output is correct
32 Correct 9 ms 600 KB Output is correct
33 Correct 9 ms 600 KB Output is correct
34 Correct 8 ms 600 KB Output is correct
35 Correct 13 ms 600 KB Output is correct
36 Correct 9 ms 600 KB Output is correct
37 Correct 10 ms 600 KB Output is correct
38 Correct 14 ms 600 KB Output is correct
39 Correct 10 ms 600 KB Output is correct
40 Correct 15 ms 600 KB Output is correct
41 Correct 11 ms 600 KB Output is correct
42 Correct 12 ms 600 KB Output is correct
43 Correct 10 ms 600 KB Output is correct
44 Correct 11 ms 600 KB Output is correct
45 Correct 7 ms 600 KB Output is correct
46 Incorrect 1 ms 600 KB Incorrect
47 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 5 ms 600 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 6 ms 596 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 9 ms 600 KB Output is correct
15 Correct 9 ms 600 KB Output is correct
16 Incorrect 1 ms 600 KB Incorrect
17 Halted 0 ms 0 KB -