oj.uz

Submission #710379

# Submission time Handle Problem Language Result Execution time Memory
710379 2023-03-15T07:55:39 Z Radin_Zahedi2 A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 208 KB 
#include<bits/stdc++.h>
#include<books.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
//#define endl '\n'


void solve(int n, int k, ll a, int s) {
    ll begs[k + 1];
    ll ends[k + 1];

    for (int i = 1; i <= k; i++) {
	begs[i] = skim(i);
    }

    for (int i = 1; i <= k; i++) {
	ends[i] = skim(n + 1 - i);
    }

    for (int i = 2; i <= k; i++) {
	begs[i] += begs[i - 1];
	ends[i] += ends[i - 1];
    }



}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -