oj.uz

Submission #575057

# Submission time Handle Problem Language Result Execution time Memory
575057 2022-06-09T14:56:51 Z Rifal A Difficult(y) Choice (BOI21_books) C++14
5 / 100
 191 ms 976 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int N, int K, long long A, int S) {

    long long arr[N+1] = {};
    for(int i = 1; i <= N; i++)
    {
        arr[i] = skim(i);
    }
    for(int i = 1; i <= N; i++)
    {
        for(int j = i+1; j <= N; j++)
        {
            for(int q = j+1; q <= N; q++)
            {
                long long sum = arr[i]+arr[j]+arr[q];
                if(sum >= A && sum <= A*2)
                {
                    answer({i,j,q});
                }
            }
        }
    }
    /*for(int i = 1; i <= N; i++)
    {
        arr[i] += arr[i-1];
    }
    for(int i = K; i <= N; i++)
    {
        long long sum = arr[i]-arr[i-K];
        if(sum >= A && sum <= A*2)
        {
            for(int j = (i-K)+1; j <= i; j++)
            {
                ans.push_back(j);
            }
            break;
        }
    }*/
        impossible();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 11 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 94 ms 208 KB Output is correct
5 Correct 12 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 173 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 12 ms 208 KB Output is correct
4 Correct 108 ms 208 KB Output is correct
5 Correct 11 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 171 ms 208 KB Output is correct
9 Incorrect 191 ms 464 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -