oj.uz

Submission #82892

# Submission time Handle Problem Language Result Execution time Memory
82892 2018-11-02T15:28:45 Z leejseo 매트 (KOI15_mat) C++11
32 / 100
 185 ms 64160 KB 
#include <bits/stdc++.h>
using namespace std;

int N, W, ans;

struct cor{
	int x, i;
	bool r;
	cor(int i_, int x_, bool r_){
		i = i_, x = x_;
		r = r_;
	}
	bool operator < (const cor &other) const{
		return x < other.x;
	}
};

struct MAT{
	int P, L, R, H, K;
	MAT(int P_, int L_, int R_, int H_, int K_){
		P = P_, L = L_, R = R_, H = H_, K = K_;
	}
	bool meet(const MAT &MT) const{
		if (R <= MT.L || L >= MT.R) return false;
		return P == MT.P ? true : ((MT.H) + H) > W;
	}
	bool operator < (const MAT &MT) const{
		return R != MT.R ? R < MT.R : L < MT.L;
	}
};

vector<MAT> A;
vector<cor> B;
int D[3001][6001], Left[3001];

void input(){
	cin >> N >> W;
	int P, L, R, H, K;
	for (int i=0; i<N; i++){
		cin >> P >> L >> R >> H >> K;
		A.push_back(MAT(P, L, R, H, K));
	}
}

void init(){
	sort(A.begin(), A.end());
	for (int i=0; i<N; i++){
		B.push_back(cor(i, A[i].L, false));
		B.push_back(cor(i, A[i].R, true));
	}
	sort(B.begin(), B.end());
	for (int i=0; i<N; i++){
		for (int j=0; j<2*N; j++){
			if (B[j].i == i){
				if (!B[j].r) Left[i] = j;
			}
		}	
	}
}

void solve(){
	for (int i=0; i<N; i++){
		for (int j=0; j<2*N; j++){
			if (A[i].R < B[j].x) break;
			D[i][j] = A[i].K;
			if (j > 0) D[i][j] = max(D[i][j], D[i][j-1]);
			if (B[j].r){
				int k = B[j].i;
				if (A[k].R <= A[i].L){
					D[i][j] = max(D[i][j], D[k][j] + A[i].K);
				}
				else if (!A[i].meet(A[k])){
					if (A[k].L < A[i].L){
						D[i][j] = max(D[i][j], D[k][Left[i]] + A[i].K);
					}
					else{
						D[i][j] = max(D[i][j], D[i][Left[k]] + A[k].K);
					}
				}
			}
			ans = max(ans, D[i][j]);
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	input();
	init();
	solve();
	cout << ans << endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 548 KB Output is correct
4 Correct 2 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1632 KB Output is correct
2 Correct 3 ms 1632 KB Output is correct
3 Correct 3 ms 1632 KB Output is correct
4 Incorrect 3 ms 1644 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 58064 KB Output is correct
2 Correct 143 ms 58116 KB Output is correct
3 Correct 125 ms 58336 KB Output is correct
4 Correct 130 ms 58408 KB Output is correct
5 Correct 120 ms 62780 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 64160 KB Output is correct
2 Correct 179 ms 64160 KB Output is correct
3 Correct 185 ms 64160 KB Output is correct
4 Correct 172 ms 64160 KB Output is correct
5 Correct 170 ms 64160 KB Output is correct
6 Correct 125 ms 64160 KB Output is correct
7 Correct 184 ms 64160 KB Output is correct
8 Incorrect 165 ms 64160 KB Output isn't correct
9 Halted 0 ms 0 KB -