Submission #1076045

#TimeUsernameProblemLanguageResultExecution timeMemory
1076045anangoOvertaking (IOI23_overtaking)C++17
39 / 100
3575 ms8444 KiB
#include "overtaking.h" #include <bits/stdc++.h> #define int long long using namespace std; int n,m; int x; int l; vector<int> s; // where the sorting stations are vector<int> t; // leaving times vector<int> w; //speeds vector<vector<int>> ET; //expected time void init(signed L, signed N, std::vector<long long> T, std::vector<signed> W, signed X, signed M, std::vector<signed> S) { s=vector<int>(S.begin(),S.end()); t=T; w=vector<int>(W.begin(),W.end()); n=N; l=L; m=M; x=X; ET=vector<vector<int>>(M,vector<int>(N,0)); //the ET of each bus at each sorting station for (int i=0; i<N; i++) { ET[0][i] = t[i]; } for (int j=1; j<m; j++) { int delta = s[j]-s[j-1]; for (int i=0; i<n; i++) { ET[j][i] = ET[j-1][i]+w[i]*delta; } for (int i=0; i<n; i++) { for (int i1=0; i1<n; i1++) { if (ET[j-1][i]>ET[j-1][i1]) { ET[j][i] = max(ET[j][i],ET[j][i1]); } } } } return; } long long arrival_time(long long Y) { for (int j=1; j<m; j++) { int delta = s[j]-s[j-1]; int prevy = Y; Y+=delta*x; //cout << j <<" " << delta <<" " << x << " " << Y << endl; for (int i=0; i<n; i++) { if (ET[j-1][i]<prevy) { Y = max(Y,ET[j][i]); //cout << "maxing " << j <<" " << i <<" " << ET[j][i] <<" " << ET[j-1][i] <<" " << prevy << endl; } } } return Y; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...