oj.uz

답안 #1029121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029121 2024-07-20T12:46:23 Z YassineBenYounes 가장 긴 여행 (IOI23_longesttrip) C++17
30 / 100
 794 ms 1376 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<random>
#include "longesttrip.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
const int mx = 260;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 998244353;
const int sq = 320;

vi graph[mx];

bool vis[mx];

vi ans;

void dfs(int node){
    vis[node] = 1;
    ans.pb(node);
    vi v;
    for(int adj : graph[node]){
        if(vis[adj])continue;
        v.pb(adj);
    }
    int s = v.size();
    if(s == 0)return;
    int ind = rng() % s;
    dfs(v[ind]);
}
/*
bool are_connected(vi a, vi b){
    return 1;
}*/

vi longest_trip(int N, int D){
    if(D == 3){
        vi res;
        for(int i = 0; i < N;i++){
            res.pb(i);
        }
        return res;
    }
    else if(D == 2){

    }
    else{
        for(int i = 0; i < N;i++){
            graph[i].clear();
        }
        for(int i = 0; i < N;i++){
            for(int j = i+1;j < N;j++){
                if(are_connected({i}, {j})){
                    graph[i].pb(j);
                    graph[j].pb(i);
                }
            }
        }
        vi res;
        for(int i = 0; i < min(N, 50);i++){
            memset(vis, 0, sizeof vis);
            ans.clear();
            int node = rng() % N;
            dfs(node);
            if(ans.size() > res.size())res = ans;
        }
        return res;
    }
}

/*
int32_t main(){
    init();
    speed;
    vi a = longest_trip(5, 2);
    cout << a.size() << endl;
    for(int x : a){
        cout << x << " ";
    }
    cout << endl;
}*/
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

longesttrip.cpp: In function 'void usaco_problem()':
longesttrip.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'void init()':
longesttrip.cpp:44:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp:46:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:113:1: warning: control reaches end of non-void function [-Wreturn-type]
  113 | }
      | ^

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 163 ms 1156 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 133 ms 344 KB Output is correct
4 Correct 366 ms 748 KB Output is correct
5 Correct 760 ms 960 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 147 ms 344 KB Output is correct
4 Correct 368 ms 772 KB Output is correct
5 Correct 742 ms 1376 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 146 ms 452 KB Output is correct
9 Correct 283 ms 600 KB Output is correct
10 Correct 772 ms 896 KB Output is correct
11 Correct 783 ms 804 KB Output is correct
12 Correct 656 ms 860 KB Output is correct
13 Correct 794 ms 976 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 34 ms 344 KB Output is correct
17 Correct 92 ms 344 KB Output is correct
18 Correct 132 ms 344 KB Output is correct
19 Correct 299 ms 600 KB Output is correct
20 Correct 311 ms 968 KB Output is correct
21 Correct 633 ms 1244 KB Output is correct
22 Correct 607 ms 984 KB Output is correct
23 Correct 649 ms 1076 KB Output is correct
24 Correct 650 ms 976 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 19 ms 344 KB Output is correct
28 Correct 26 ms 344 KB Output is correct
29 Correct 25 ms 344 KB Output is correct
30 Correct 197 ms 344 KB Output is correct
31 Correct 150 ms 344 KB Output is correct
32 Correct 176 ms 456 KB Output is correct
33 Correct 235 ms 520 KB Output is correct
34 Correct 272 ms 496 KB Output is correct
35 Correct 267 ms 732 KB Output is correct
36 Correct 650 ms 1036 KB Output is correct
37 Correct 648 ms 876 KB Output is correct
38 Correct 722 ms 840 KB Output is correct
39 Correct 720 ms 1328 KB Output is correct
40 Correct 702 ms 772 KB Output is correct
41 Correct 711 ms 972 KB Output is correct
42 Correct 727 ms 1292 KB Output is correct
43 Correct 719 ms 948 KB Output is correct
44 Correct 678 ms 944 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 14 ms 344 KB Output is correct
48 Correct 21 ms 344 KB Output is correct
49 Correct 15 ms 344 KB Output is correct
50 Correct 164 ms 460 KB Output is correct
51 Correct 163 ms 452 KB Output is correct
52 Correct 147 ms 344 KB Output is correct
53 Correct 251 ms 600 KB Output is correct
54 Correct 272 ms 512 KB Output is correct
55 Correct 274 ms 596 KB Output is correct
56 Correct 685 ms 868 KB Output is correct
57 Correct 742 ms 1120 KB Output is correct
58 Correct 791 ms 1084 KB Output is correct
59 Correct 722 ms 900 KB Output is correct
60 Correct 739 ms 816 KB Output is correct
61 Correct 785 ms 1012 KB Output is correct
62 Correct 733 ms 1192 KB Output is correct
63 Correct 753 ms 1136 KB Output is correct
64 Correct 738 ms 1108 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Partially correct 171 ms 468 KB Output is partially correct
4 Partially correct 366 ms 600 KB Output is partially correct
5 Partially correct 772 ms 1132 KB Output is partially correct
6 Incorrect 1 ms 352 KB Incorrect
7 Halted 0 ms 0 KB -