oj.uz

Submission #18028

# Submission time Handle Problem Language Result Execution time Memory
18028 2016-01-18T12:40:09 Z gs14004 매트 (KOI15_mat) C++14
100 / 100
 84 ms 107628 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int oo = 1e9;
 
struct rect{ int s, e, x, h, t; };
bool cmp(rect a, rect b){return a.e < b.e;}
 
rect a[3005];
int n, w;
int dp[3005][3005];
int low[6005];
 
bool cross(int p, int q){
    return (a[p].h + a[q].h <= w || a[q].s >= a[p].e);
}
 
vector<int> v;
int pmax[2][3005][3005];
 
int main(){
    scanf("%d %d",&n,&w);
    for(int i=0; i<n; i++){
        scanf("%d %d %d %d %d",&a[i].t,&a[i].s,&a[i].e,&a[i].h,&a[i].x);
    }
    a[n++] = {oo, oo, 0, 0, 0};
    a[n++] = {oo, oo, 0, 0, 1};
    for(int i=0; i<n; i++){
        v.push_back(a[i].s);
        v.push_back(a[i].e);
    }
    sort(v.begin(), v.end());
    v.resize(unique(v.begin(), v.end()) - v.begin());
    for(int i=0; i<n; i++){
        a[i].s = lower_bound(v.begin(), v.end(), a[i].s) - v.begin();
        a[i].e = lower_bound(v.begin(), v.end(), a[i].e) - v.begin();
    }
    sort(a, a+n, cmp);
    int p = 0;
    for(int i=0; i<v.size(); i++){
        while(p < n && a[p].e <= i) p++;
        low[i] = p;
    }
    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            if(a[i].t == a[j].t || !cross(i, j)){
                dp[i][j] = -1e9;
            }
            else{
                int p = min(low[a[i].s]-1, i-1);
                if(p >= 0) dp[i][j] = max(dp[i][j], pmax[a[i].t][p][j]);
                p = min(low[a[j].s]-1, i-1);
                if(p >= 0) dp[i][j] = max(dp[i][j], pmax[a[j].t][p][i]);
            }
            pmax[a[i].t][i][j] = (i ? pmax[a[i].t][i-1][j] : -oo);
            pmax[a[i].t][i][j] = max(pmax[a[i].t][i][j], dp[i][j] + a[i].x);
            pmax[!a[i].t][i][j] = (i ? pmax[!a[i].t][i-1][j] : -oo);
            // pmax(t, i, j) == Max (dp[k][j] + a[k].x) (k <= i, a[k].t == t)
        }
    }
    printf("%d",dp[n-2][n-1]);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 107628 KB Output is correct
2 Correct 0 ms 107628 KB Output is correct
3 Correct 0 ms 107628 KB Output is correct
4 Correct 0 ms 107628 KB Output is correct
5 Correct 0 ms 107628 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 107628 KB Output is correct
2 Correct 0 ms 107628 KB Output is correct
3 Correct 1 ms 107628 KB Output is correct
4 Correct 0 ms 107628 KB Output is correct
5 Correct 0 ms 107628 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 107628 KB Output is correct
2 Correct 0 ms 107628 KB Output is correct
3 Correct 0 ms 107628 KB Output is correct
4 Correct 0 ms 107628 KB Output is correct
5 Correct 0 ms 107628 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 107628 KB Output is correct
2 Correct 34 ms 107628 KB Output is correct
3 Correct 25 ms 107628 KB Output is correct
4 Correct 20 ms 107628 KB Output is correct
5 Correct 26 ms 107628 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 107628 KB Output is correct
2 Correct 84 ms 107628 KB Output is correct
3 Correct 71 ms 107628 KB Output is correct
4 Correct 79 ms 107628 KB Output is correct
5 Correct 68 ms 107628 KB Output is correct
6 Correct 73 ms 107628 KB Output is correct
7 Correct 82 ms 107628 KB Output is correct
8 Correct 78 ms 107628 KB Output is correct
9 Correct 36 ms 107628 KB Output is correct
10 Correct 78 ms 107628 KB Output is correct