oj.uz

답안 #1071939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071939 2024-08-23T12:35:30 Z Mihailo 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 10 ms 344 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pll pair<long long, long long>
#define MOD 1000000007ll
#define xx first
#define yy second
using namespace std;
typedef long long ll;
mt19937 mt(169);

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

vector<int> sh;

bool query(vector<int> a, vector<int> b) {
    if(a.empty()||b.empty()) while (true);
    vector<int> A, B;
    for(int i=0; i<a.size(); i++) A.pb(sh[a[i]]);
    for(int i=0; i<b.size(); i++) B.pb(sh[b[i]]);
    /*for(int i:a) cout<<i<<' ';
    cout<<'\n';
    for(int i:b) cout<<i<<' ';
    cout<<'\n';*/
    return are_connected(A, B);
}

int cur, zadnji, sled;
bool nema;
vector<int> put, klika;

int ko(int jedan, vector<int> vise, int l, int r) {
    if(l==r) return l;
    vector<int> a, b;
    a.pb(jedan);
    int m=(l+r)/2;
    for(int i=l; i<=m; i++) b.pb(vise[i]);
    if(query(a, b)) return ko(jedan, vise, l, m);
    else return ko(jedan, vise, m+1, r);
}

int komnogo(vector<int> jedan, vector<int> vise, int l, int r) {
    if(l==r) return l;
    vector<int> a, b;
    a=jedan;
    int m=(l+r)/2;
    for(int i=l; i<=m; i++) b.pb(vise[i]);
    if(query(a, b)) return komnogo(jedan, vise, l, m);
    else return komnogo(jedan, vise, m+1, r);
}

vector<int> vrati(vector<int> v) {
    vector<int> rez;
    for(int i:v) rez.pb(sh[i]);
    return rez;
}

vector<int> longest_trip(int N, int D) {
    sh.clear();
    for(int i=0; i<N; i++) sh.pb(i);
    shuffle(sh.begin(), sh.end(), mt);
    //for(int i=0; i<N; i++) cout<<sh[i]<<' ';
    //cout<<'\n';
    cur=0;
    zadnji=0;
    klika.clear();
    put.clear();
    put.pb(0);
    vector<int> a, b;
    while(zadnji<N-1) {
        if(zadnji<cur) while (true);
        a.clear();
        b.clear();
        if(klika.empty()) {
            a.pb(cur);
            b.pb(zadnji+1);
            if(query(a, b)) {
                cur=zadnji+1;
                put.pb(cur);
                zadnji=max(cur, zadnji);
                continue;
            }
            klika.pb(zadnji+1);
            zadnji=max(zadnji, klika.back());
            nema=true;
        }
        else {
            //cout<<cur<<' '<<zadnji<<' '<<klika.back()<<' '<<nema<<'\n';
            sled=zadnji+1;
            if(nema) {
                a.pb(cur);
                b.pb(sled);
                if(query(a, b)) {
                    cur=sled;
                    put.pb(cur);
                    zadnji=max(cur, zadnji);
                    nema=false;
                }
                else {
                    klika.pb(sled);
                    zadnji=max(klika.back(), zadnji);
                }
                continue;
            }
            a.pb(cur);
            a.pb(sled);
            if(query(a, klika)) {
                a.pop_back();
                if(!query(a, klika)) {
                    b.clear();
                    b.pb(sled);
                    if(query(a, b)) {
                        cur=sled;
                        put.pb(cur);
                        zadnji=max(cur, zadnji);
                    }
                    else goto label;
                }
                sled=klika[ko(cur, klika, 0, klika.size()-1)];
                put.pb(sled);
                for(int i:klika) {
                    if(i!=sled) {
                        put.pb(i);
                        cur=i;
                    }
                }
                klika.clear();
                continue;
            }
            label:
            nema=true;
            klika.pb(sled);
            zadnji=max(zadnji, klika.back());
        }
    }
    if((!put.empty())&&(!klika.empty())&&query(put, klika)) {
        a.clear();
        b.clear();
        a.pb(put[0]);
        if(query(a, klika)) {
            sled=klika[ko(put[0], klika, 0, klika.size()-1)];
            reverse(put.begin(), put.end());
            put.pb(sled);
            for(int i:klika) if(i!=sled) put.pb(i);
            return vrati(put);
        }
        a.clear();
        a.pb(put.back());
        if(query(a, klika)) {
            sled=klika[ko(put.back(), klika, 0, klika.size()-1)];
            put.pb(sled);
            for(int i:klika) if(i!=sled) put.pb(i);
            return vrati(put);
        }
        cur=put[komnogo(klika, put, 0, put.size())];
        sled=klika[ko(cur, klika, 0, klika.size()-1)];
        nema=false;
        for(int i:put) {
            if(nema) b.pb(i);
            if(i==cur) nema=true;
        }
        for(int i:put) {
            b.pb(i);
            if(i==cur) break;
        }
        b.pb(sled);
        for(int i:klika) if(i!=sled) b.pb(i);
        return vrati(b);
    }
    else {
        if(put.size()>klika.size()) return vrati(put);
        else return vrati(klika);
    }
}

Compilation message

longesttrip.cpp: In function 'bool query(std::vector<int>, std::vector<int>)':
longesttrip.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i=0; i<a.size(); i++) A.pb(sh[a[i]]);
      |                  ~^~~~~~~~~
longesttrip.cpp:20:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0; i<b.size(); i++) B.pb(sh[b[i]]);
      |                  ~^~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 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 6 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 4 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 7 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 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -