oj.uz

답안 #1029115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029115 2024-07-20T12:37:54 Z YassineBenYounes 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 981 ms 1368 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[0]);
}
/*
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{
        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 < N;i++){
            memset(vis, 0, sizeof vis);
            ans.clear();
            dfs(i);
            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 dfs(int)':
longesttrip.cpp:72:9: warning: unused variable 'ind' [-Wunused-variable]
   72 |     int ind = rng() % s;
      |         ^~~
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);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 31 ms 344 KB Output is correct
3 Correct 135 ms 344 KB Output is correct
4 Correct 443 ms 740 KB Output is correct
5 Correct 930 ms 1048 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Correct 169 ms 344 KB Output is correct
9 Correct 309 ms 488 KB Output is correct
10 Correct 954 ms 1304 KB Output is correct
11 Correct 899 ms 1368 KB Output is correct
12 Correct 868 ms 1008 KB Output is correct
13 Correct 856 ms 1072 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 161 ms 452 KB Output is correct
4 Correct 407 ms 344 KB Output is correct
5 Correct 913 ms 704 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 187 ms 344 KB Output is correct
9 Correct 319 ms 592 KB Output is correct
10 Correct 924 ms 948 KB Output is correct
11 Correct 913 ms 724 KB Output is correct
12 Correct 900 ms 896 KB Output is correct
13 Correct 938 ms 1132 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 49 ms 344 KB Output is correct
17 Correct 85 ms 344 KB Output is correct
18 Correct 143 ms 344 KB Output is correct
19 Correct 292 ms 704 KB Output is correct
20 Correct 334 ms 480 KB Output is correct
21 Correct 933 ms 880 KB Output is correct
22 Correct 912 ms 776 KB Output is correct
23 Correct 870 ms 1060 KB Output is correct
24 Correct 934 ms 1092 KB Output is correct
25 Correct 18 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 22 ms 344 KB Output is correct
28 Correct 26 ms 344 KB Output is correct
29 Correct 21 ms 344 KB Output is correct
30 Correct 213 ms 460 KB Output is correct
31 Correct 234 ms 344 KB Output is correct
32 Correct 197 ms 448 KB Output is correct
33 Correct 341 ms 620 KB Output is correct
34 Correct 352 ms 592 KB Output is correct
35 Correct 339 ms 608 KB Output is correct
36 Correct 981 ms 908 KB Output is correct
37 Correct 925 ms 888 KB Output is correct
38 Correct 872 ms 1104 KB Output is correct
39 Correct 836 ms 848 KB Output is correct
40 Correct 730 ms 1112 KB Output is correct
41 Correct 719 ms 616 KB Output is correct
42 Correct 801 ms 968 KB Output is correct
43 Correct 748 ms 792 KB Output is correct
44 Correct 734 ms 1252 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 21 ms 344 KB Output is correct
48 Correct 17 ms 344 KB Output is correct
49 Correct 18 ms 344 KB Output is correct
50 Correct 176 ms 592 KB Output is correct
51 Correct 156 ms 344 KB Output is correct
52 Correct 191 ms 344 KB Output is correct
53 Correct 305 ms 596 KB Output is correct
54 Correct 280 ms 344 KB Output is correct
55 Correct 294 ms 1112 KB Output is correct
56 Correct 834 ms 1108 KB Output is correct
57 Correct 780 ms 948 KB Output is correct
58 Correct 780 ms 1120 KB Output is correct
59 Correct 765 ms 1052 KB Output is correct
60 Correct 740 ms 1236 KB Output is correct
61 Correct 718 ms 904 KB Output is correct
62 Correct 729 ms 720 KB Output is correct
63 Correct 764 ms 784 KB Output is correct
64 Correct 723 ms 880 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Partially correct 163 ms 344 KB Output is partially correct
4 Partially correct 383 ms 848 KB Output is partially correct
5 Partially correct 866 ms 1104 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 18 ms 344 KB Output is correct
8 Partially correct 145 ms 468 KB Output is partially correct
9 Partially correct 297 ms 728 KB Output is partially correct
10 Partially correct 833 ms 888 KB Output is partially correct
11 Partially correct 824 ms 856 KB Output is partially correct
12 Partially correct 812 ms 888 KB Output is partially correct
13 Partially correct 780 ms 1004 KB Output is partially correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 13 ms 344 KB Output is correct
16 Incorrect 6 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -