제출 #884812

#제출 시각아이디문제언어결과실행 시간메모리
884812djs100201가장 긴 여행 (IOI23_longesttrip)C++17
5 / 100
2 ms600 KiB
#include "longesttrip.h" #include<bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC target("avx2") #define all(v) v.begin(),v.end() using namespace std; using ll = long long; using P = pair<ll, ll>; using PP = pair<ll, P>; const ll n_ = 1e5 + 505, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353; ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k; ll gcd(ll x, ll y) { if (!y)return x; return gcd(y, x % y); }; vector<int> longest_trip(int N,int D){ vector<int>ret; n=N; if(D==3){ for(int i=0;i<n;i++)ret.push_back(i); } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...