oj.uz

Submission #861828

# Submission time Handle Problem Language Result Execution time Memory
861828 2023-10-17T03:42:05 Z sleepntsheep Collecting Stamps 3 (JOI20_ho_t3) C++17
0 / 100
 8 ms 64860 KB 
#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;

#define N 202
#define ALL(x) x.begin(), x.end()

int n, l, x[N], t[N], dp[N][N][N][2];

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> l;
    for (int i = 1; i <= n; ++i) cin >> x[i];
    for (int i = 1; i <= n; ++i) cin >> t[i];

    memset(dp, 0, sizeof dp);


    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 75.0

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