#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;
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |