oj.uz

답안 #1029084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029084 2024-07-20T12:11:13 Z YassineBenYounes 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 907 ms 1404 KB 
#include<bits/stdc++.h>
#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;
////////////////////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 = 305;
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);
    for(int adj : graph[node]){
        if(vis[adj])continue;
        dfs(adj);
        break;
    }
}

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;
}*/
/*
    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:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'void init()':
longesttrip.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Correct 148 ms 344 KB Output is correct
4 Correct 402 ms 468 KB Output is correct
5 Correct 907 ms 880 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 27 ms 344 KB Output is correct
8 Correct 131 ms 344 KB Output is correct
9 Correct 325 ms 592 KB Output is correct
10 Correct 858 ms 1104 KB Output is correct
11 Correct 806 ms 848 KB Output is correct
12 Correct 877 ms 724 KB Output is correct
13 Correct 814 ms 876 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Correct 125 ms 344 KB Output is correct
4 Correct 404 ms 480 KB Output is correct
5 Correct 835 ms 480 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 26 ms 344 KB Output is correct
8 Correct 148 ms 344 KB Output is correct
9 Correct 268 ms 344 KB Output is correct
10 Correct 802 ms 1172 KB Output is correct
11 Correct 763 ms 752 KB Output is correct
12 Correct 811 ms 948 KB Output is correct
13 Correct 737 ms 708 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 30 ms 344 KB Output is correct
17 Correct 86 ms 344 KB Output is correct
18 Correct 111 ms 344 KB Output is correct
19 Correct 254 ms 344 KB Output is correct
20 Correct 250 ms 592 KB Output is correct
21 Correct 711 ms 912 KB Output is correct
22 Correct 711 ms 1168 KB Output is correct
23 Correct 745 ms 1004 KB Output is correct
24 Correct 787 ms 896 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 22 ms 344 KB Output is correct
28 Correct 24 ms 344 KB Output is correct
29 Correct 19 ms 344 KB Output is correct
30 Correct 149 ms 344 KB Output is correct
31 Correct 161 ms 344 KB Output is correct
32 Correct 176 ms 344 KB Output is correct
33 Correct 262 ms 344 KB Output is correct
34 Correct 295 ms 724 KB Output is correct
35 Correct 291 ms 716 KB Output is correct
36 Correct 743 ms 1004 KB Output is correct
37 Correct 702 ms 880 KB Output is correct
38 Correct 717 ms 1108 KB Output is correct
39 Correct 758 ms 1140 KB Output is correct
40 Correct 724 ms 936 KB Output is correct
41 Correct 707 ms 776 KB Output is correct
42 Correct 705 ms 1216 KB Output is correct
43 Correct 684 ms 1404 KB Output is correct
44 Correct 695 ms 1040 KB Output is correct
45 Correct 14 ms 344 KB Output is correct
46 Correct 12 ms 344 KB Output is correct
47 Correct 19 ms 344 KB Output is correct
48 Correct 17 ms 344 KB Output is correct
49 Correct 21 ms 344 KB Output is correct
50 Correct 131 ms 464 KB Output is correct
51 Correct 152 ms 600 KB Output is correct
52 Correct 163 ms 344 KB Output is correct
53 Correct 261 ms 600 KB Output is correct
54 Correct 257 ms 340 KB Output is correct
55 Correct 294 ms 728 KB Output is correct
56 Correct 836 ms 704 KB Output is correct
57 Correct 759 ms 1356 KB Output is correct
58 Correct 747 ms 944 KB Output is correct
59 Correct 711 ms 1280 KB Output is correct
60 Correct 720 ms 972 KB Output is correct
61 Correct 704 ms 848 KB Output is correct
62 Correct 750 ms 720 KB Output is correct
63 Correct 761 ms 980 KB Output is correct
64 Correct 645 ms 836 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Partially correct 114 ms 456 KB Output is partially correct
4 Partially correct 317 ms 468 KB Output is partially correct
5 Partially correct 609 ms 876 KB Output is partially correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 23 ms 356 KB Output is correct
8 Partially correct 117 ms 344 KB Output is partially correct
9 Partially correct 245 ms 480 KB Output is partially correct
10 Partially correct 661 ms 792 KB Output is partially correct
11 Partially correct 670 ms 736 KB Output is partially correct
12 Partially correct 688 ms 1056 KB Output is partially correct
13 Partially correct 672 ms 1124 KB Output is partially correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 5 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -