oj.uz

Submission #216832

# Submission time Handle Problem Language Result Execution time Memory
216832 2020-03-28T06:57:50 Z oolimry Collecting Stamps 3 (JOI20_ho_t3) C++14
0 / 100
 5 ms 256 KB 
#include <bits/stdc++.h>
#define x first
#define t second

using namespace std;
typedef pair<long long, long long> ii;
long long inf = (1LL << 48LL);
vector<ii> arr = {ii({0,0})};

static long long memo[205][205][205];

long long dp(int pos, int bound, int taken){
	if(memo[pos][bound][taken] != inf) return memo[pos][bound][taken];
	
	
	
	return inf;
}
int main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	long long n, L; cin >> n >> L;
	
	for(int i = 0;i < n;i++){
		ii a; cin >> a.x >> a.t;
		arr.push_back(a);
	}
	
	for(int i = 0;i <= n;i++){
		for(int j = 0;j <= n;j++){
			for(int k = 0;k <= n;k++){
				memo[i][j][k] = -1;
			}
		}
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -