# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305111 | ansol4328 | 매트 (KOI15_mat) | C++14 | 274 ms | 62200 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<bits/stdc++.h>
using namespace std;
struct A{
int t, s, e, h, v;
A() {}
};
int n, w;
A m[3005];
int D[3005][6005], R[6005];
vector<int> lst[6005];
bool cmp(const A &lhs, const A &rhs){
return lhs.e!=rhs.e ? lhs.e<rhs.e : lhs.s<rhs.s;
}
bool cross(const A &lhs, const A &rhs){
if(lhs.e<=rhs.s || lhs.s>=rhs.e) return false;
if(lhs.t!=rhs.t && lhs.h+rhs.h<=w) return false;
return true;
}
int main()
{
vector<int> idx;
scanf("%d %d",&n,&w);
for(int i=1 ; i<=n ; i++){
scanf("%d %d %d %d %d",&m[i].t,&m[i].s,&m[i].e,&m[i].h,&m[i].v);
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |