# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230144 | Andrei_Cotor | Collecting Stamps 3 (JOI20_ho_t3) | C++11 | 92 ms | 67004 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
using namespace std;
int Poz[205],T[205];
long long Dp[2][205][205][205];
void propag(int tip, int i, int j, int nr, long long time)
{
if(tip==0)
{
if(T[i]>=time)
nr++;
}
else if(T[j]>=time)
{
nr++;
}
Dp[tip][i][j][nr]=min(Dp[tip][i][j][nr],time);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,l;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |