Submission #607532

#TimeUsernameProblemLanguageResultExecution timeMemory
607532MohamedFaresNebili철로 (IOI14_rail)C++14
8 / 100
73 ms508 KiB
#include <bits/stdc++.h> #include "rail.h" /// #pragma GCC optimize ("Ofast") /// #pragma GCC target ("avx2") /// #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; using ld = long double; #define ff first #define ss second #define pb push_back #define all(x) (x).begin(), (x).end() #define lb lower_bound const int MOD = 998244353; void findLocation(int n, int first, int location[], int stype[]) { location[0] = first; stype[0] = 1; for(int l = 1; l < n; l++) stype[l] = 2, location[l] = first + getDistance(0, l); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...