oj.uz

답안 #1029118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029118 2024-07-20T12:43:44 Z YassineBenYounes 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 795 ms 1296 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{
        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();
            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 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 165 ms 1080 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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Correct 146 ms 344 KB Output is correct
4 Correct 380 ms 704 KB Output is correct
5 Correct 734 ms 1296 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 28 ms 344 KB Output is correct
8 Correct 143 ms 464 KB Output is correct
9 Correct 247 ms 344 KB Output is correct
10 Correct 761 ms 924 KB Output is correct
11 Correct 745 ms 848 KB Output is correct
12 Correct 713 ms 640 KB Output is correct
13 Correct 706 ms 884 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 143 ms 452 KB Output is correct
4 Correct 385 ms 600 KB Output is correct
5 Correct 697 ms 1244 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 144 ms 600 KB Output is correct
9 Correct 278 ms 344 KB Output is correct
10 Correct 705 ms 756 KB Output is correct
11 Correct 757 ms 956 KB Output is correct
12 Correct 741 ms 780 KB Output is correct
13 Correct 776 ms 956 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 37 ms 344 KB Output is correct
17 Correct 92 ms 428 KB Output is correct
18 Correct 152 ms 600 KB Output is correct
19 Correct 300 ms 736 KB Output is correct
20 Correct 319 ms 600 KB Output is correct
21 Correct 766 ms 944 KB Output is correct
22 Correct 773 ms 892 KB Output is correct
23 Correct 755 ms 848 KB Output is correct
24 Correct 767 ms 1260 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 20 ms 344 KB Output is correct
28 Correct 16 ms 344 KB Output is correct
29 Correct 23 ms 596 KB Output is correct
30 Correct 182 ms 344 KB Output is correct
31 Correct 145 ms 600 KB Output is correct
32 Correct 183 ms 600 KB Output is correct
33 Correct 276 ms 712 KB Output is correct
34 Correct 290 ms 472 KB Output is correct
35 Correct 282 ms 592 KB Output is correct
36 Correct 749 ms 960 KB Output is correct
37 Correct 749 ms 1076 KB Output is correct
38 Correct 716 ms 1084 KB Output is correct
39 Correct 795 ms 1036 KB Output is correct
40 Correct 697 ms 1296 KB Output is correct
41 Correct 723 ms 664 KB Output is correct
42 Correct 674 ms 728 KB Output is correct
43 Correct 737 ms 740 KB Output is correct
44 Correct 718 ms 980 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 7 ms 352 KB Output is correct
47 Correct 31 ms 344 KB Output is correct
48 Correct 19 ms 344 KB Output is correct
49 Correct 20 ms 344 KB Output is correct
50 Correct 219 ms 356 KB Output is correct
51 Correct 133 ms 476 KB Output is correct
52 Correct 186 ms 600 KB Output is correct
53 Correct 262 ms 608 KB Output is correct
54 Correct 265 ms 600 KB Output is correct
55 Correct 302 ms 692 KB Output is correct
56 Correct 692 ms 884 KB Output is correct
57 Correct 700 ms 1080 KB Output is correct
58 Correct 647 ms 864 KB Output is correct
59 Correct 599 ms 844 KB Output is correct
60 Correct 701 ms 816 KB Output is correct
61 Correct 698 ms 760 KB Output is correct
62 Correct 662 ms 828 KB Output is correct
63 Correct 683 ms 1008 KB Output is correct
64 Correct 699 ms 1040 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Partially correct 157 ms 344 KB Output is partially correct
4 Partially correct 339 ms 600 KB Output is partially correct
5 Partially correct 765 ms 896 KB Output is partially correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Partially correct 182 ms 600 KB Output is partially correct
9 Partially correct 280 ms 600 KB Output is partially correct
10 Partially correct 732 ms 872 KB Output is partially correct
11 Partially correct 724 ms 860 KB Output is partially correct
12 Partially correct 713 ms 1124 KB Output is partially correct
13 Partially correct 777 ms 848 KB Output is partially correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 45 ms 344 KB Output is correct
17 Partially correct 84 ms 344 KB Output is partially correct
18 Partially correct 159 ms 600 KB Output is partially correct
19 Partially correct 291 ms 600 KB Output is partially correct
20 Partially correct 273 ms 592 KB Output is partially correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 17 ms 344 KB Output is correct
24 Correct 20 ms 344 KB Output is correct
25 Correct 17 ms 344 KB Output is correct
26 Partially correct 198 ms 472 KB Output is partially correct
27 Partially correct 188 ms 600 KB Output is partially correct
28 Partially correct 174 ms 600 KB Output is partially correct
29 Partially correct 300 ms 1112 KB Output is partially correct
30 Partially correct 297 ms 724 KB Output is partially correct
31 Partially correct 276 ms 344 KB Output is partially correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 28 ms 344 KB Output is correct
35 Correct 15 ms 344 KB Output is correct
36 Correct 13 ms 344 KB Output is correct
37 Incorrect 84 ms 464 KB Incorrect
38 Halted 0 ms 0 KB -