제출 #202535

#제출 시각아이디문제언어결과실행 시간메모리
202535galen_colin철로 (IOI14_rail)C++14
0 / 100
741 ms67704 KiB
#include <bits/stdc++.h> #include <chrono> using namespace std; using namespace std::chrono; // #pragma GCC target ("avx2") // #pragma GCC optimization ("O3") // #pragma GCC optimization ("unroll-loops") // #pragma optimization_level 3 // #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define f0r(a, b) for (long long a = 0; a < (b); a++) #define f1r(a, b, c) for (long long a = (b); a < (c); a++) #define f0rd(a, b) for (long long a = (b); a >= 0; a--) #define f1rd(a, b, c) for (long long a = (b); a >= (c); a--) #define ms(arr, v) memset(arr, v, sizeof(arr)) #define pb push_back #define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);} #define mp make_pair #define f first #define s second #define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];} #define all(v) v.begin(), v.end() #define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());} #define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);} #define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele]; #define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele]; #define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';} #define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';} typedef long long ll; typedef double ld; typedef long double lld; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<pii> vpi; typedef vector<pll> vpl; template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v); template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; } template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) { cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]"; } template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } // template<typename A, typename B> ll max(A x, B y) { // return x > y ? x : y; // } // template<typename A, typename B> ll min(A x, B y) { // return x < y ? x : y; // } mt19937 rng(steady_clock::now().time_since_epoch().count()); /* usage - just do rng() */ void usaco(string filename) { // #pragma message("be careful, freopen may be wrong") freopen((filename + ".in").c_str(), "r", stdin); freopen((filename + ".out").c_str(), "w", stdout); } const lld pi = 3.14159265358979323846; const ll mod = 1000000007; // const ll mod = 998244353; /* 4( 3) 0( 1( 2) 5) */ // namespace interactor { // int getDistance(int a, int b) { // int hardcode[6][6] = { // {0, 3, 2, 7, 6, 3}, // {0, 0, 1, 6, 5, 2}, // {0, 0, 0, 5, 4, 3}, // {0, 0, 0, 0, 1, 6}, // {0, 0, 0, 0, 0, 5}, // {0, 0, 0, 0, 0, 0} // }; // return hardcode[a][b]; // // if (a == 0) { // // return b; // // } else { // // if (a < 3 && b < 3) return a + b; // // else if (a > 2 && b > 2) return a + b - 2; // // else return a + b - 2; // // } // } // } // using namespace interactor; // void findLocation(int n, int first, int location[], int stype[]); // int main() { // findLocation(6, 0, new int[6], new int[6]); // } #include "rail.h" ll n, m, k, q, Q, T, l, r, x, y, z; ll a[1000005]; ll b[1000005]; ll c[1000005]; string s, t; ll ans = 0; int dists[5005][5005]; inline int gdist(int a, int b) { if (a == b) return 0; int x = min(a, b); int y = max(a, b); return dists[x][y]; } void fillDist(int n) { f0r(i, n) f1r(j, i + 1, n) dists[i][j] = getDistance(i, j); } void findLocation(int n, int first, int location[], int stype[]) { fillDist(n); stype[0] = 1; location[0] = first; int mdist = mod, mloc = -1; f1r(i, 1, n) { bool cond = 1; f1r(j, 1, n) { if (j != i && gdist(0, j) + gdist(j, i) == gdist(0, i)) { cond = 0; } } stype[i] = cond + 1; if (stype[i] == 2) { location[i] = location[0] + gdist(0, i); if (gdist(0, i) < mdist) { mdist = gdist(0, i); mloc = i; } } } f1r(i, 1, n) { if (stype[i] == 1) { location[i] = location[mloc] - gdist(mloc, i); if (location[i] < location[0]) { stype[i] = 3; } } } f1r(i, 1, n) { if (stype[i] == 3) { int mid = -1; f1r(j, 1, n) { if (j != i && j != mloc && gdist(mloc, j) + gdist(j, i) == gdist(mloc, i)) { mid = j; break; } } if (mid == -1) { stype[i] = 1; } else { stype[i] = 4; } } } f1r(i, 1, n) { if (stype[i] == 4) { int mid = -1; f1r(j, 1, n) { if (j != i && j != mloc && gdist(mloc, j) + gdist(j, i) == gdist(mloc, i)) { mid = j; break; } } stype[i] = 2; location[i] = location[mid] + gdist(mid, i); } } ao(location, n); ao(stype, n); } // int main() { // io; // // freopen("case", "r", stdin); // // freopen("test.txt", "r", stdin); // // freopen("case", "w", stdout); // // freopen("file.in", "r", stdin); // // usaco("file"); // }

컴파일 시 표준 에러 (stderr) 메시지

rail.cpp: In function 'void usaco(std::__cxx11::string)':
rail.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rail.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...