oj.uz

Submission #1068687

# Submission time Handle Problem Language Result Execution time Memory
1068687 2024-08-21T11:22:58 Z Malix Longest Trip (IOI23_longesttrip) C++17
5 / 100
 8 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

std::vector<int> longest_trip(int n, int d)
{
    if(d==3){
        vi ans;
        REP(i,0,n)ans.PB(i);
        return ans;
    }
    if(d==2){
        deque<int> dq;
        vi a,b;
        a.PB(0);b.PB(1);
        if(are_connected(a,b)){
            dq.PB(0);
            dq.PB(1);
            b.pop_back();b.PB(2);
            if(are_connected(a,b))dq.push_front(2);
            else dq.push_front(2);
        }
        else{
            dq.PB(0);
            dq.PB(2);
            dq.PB(1);
        }
        REP(i,3,n){
            a.clear();b.clear();
            a.PB(dq.back());b.PB(i);
            if(are_connected(a,b))dq.push_back(i);
            else dq.push_front(i);
        }
        vi ans;
        REP(i,0,n){
            ans.PB(dq.front());
            dq.pop_front();
        }
        return ans;
    }
    return {};
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 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
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -