제출 #839116

#제출 시각아이디문제언어결과실행 시간메모리
839116thegamercoder19경주 (Race) (IOI11_race)C++14
9 / 100
43 ms10244 KiB
#include "race.h" #include <bits/stdc++.h> #define M_PI 3.14159265358979323846 #define FILER 0 using ll = long long; using ull = unsigned long long; using ld = long double; const ll MOD = pow(10, 9) + 7; const ll INFL = 0x3f3f3f3f3f3f3f3f; const ull INFUL = 0x3f3f3f3f3f3f3f3f; const ll INFT = 0x3f3f3f3f; const ull MAX = 1LL << 24; const ll MODD = 998244353; const double EPS = 1e-10; #define V vector #define pll pair<ll, ll> #define pull2 pair<ull,ull> #define MS multiset #define M map #define Q queue #define PQ priority_queue #define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c) #define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c) #define FORA(a,i) for(auto &i : a) #define all(v) v.begin(),v.end() #define sz(v) v.size() #define sorta(a) sort(all(a)) #define sortd(a) sort(all(a), greater<ll>()) #define setp(x) setprecision(x)<<fixed #define RET return #define log(a,b) log(b)/log(a) #define WH(s) while(s) #define WHI(t) WH(t--) #define YES cout<<"YES"<<endl; #define NO cout<<"NO"<<endl; #define Yes cout<<"Yes"<<endl; #define No cout<<"No"<<endl; #define YESNO(s) cout << (s ? "YES" : "NO") << endl; #define YesNo(s) cout<<(s?"Yes":"No")<<endl; #define TYP 0 using namespace std; struct edge { ll u, v, k; }; V<V<pll>> g; int best_path(int n, int k, int h[][2], int l[]) { g.resize(n + 1); FOR(ll, i, 1, n, 1)g[h[i][0]].push_back({ h[i][1], l[i] }), g[h[i][1]].push_back({ h[i][0], l[i] }); ll ans = INFL,j=0,s=0; FOR(ll, i, 0, n - 1, 1) { for (j = i; j < n - 1; j++) { if (s + l[j] == k) { ans = min(ans, j - i + 1); break; } if (s + l[j] > k)break; s += l[j]; } s = 0; } RET ans==INFL?-1:ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...