oj.uz

Submission #574854

# Submission time Handle Problem Language Result Execution time Memory
574854 2022-06-09T12:36:38 Z Majid A Difficult(y) Choice (BOI21_books) C++17
5 / 100
 219 ms 976 KB 
#include<bits/stdc++.h>
#include<books.h>
using namespace std;
using ll = long long;
using db = double;
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
#define f first
#define s second
const int MOD = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);

// ll answer(vector<int> x){
// 
//     cout<<"ok";
// }
// 
// ll skim(ll x){
// 
//     return x+2;
// }
// 
// void impossible(){
// 
//     cout<<"not ok";
// }

void solve(int n, int k, ll a, int s){
    
    vector<ll> vec(n+1);
    
    for(ll i = 1; i <= n; i++){
        
        vec[i] = skim(i);
    }

    if(k==3){
        
        for(ll i = 1; i <= n; i++){
            for(ll j = i+1; j <= n; j++){
                for(ll l = j+1; l <= n; l++){
                        
                    ll sum = vec[i] + vec[j] + vec[l];
                    
                    if(sum>=a and sum<=2*a){
                        
                        vector<int> temp;
                        temp.pb(i);
                        temp.pb(j);
                        temp.pb(l);
                        answer(temp);
                    }
                }
                
            }
            
        }
    }

impossible();
    // answer(temp);
    
    
}
// 
// int main(){
// 
//     solve(5, 3, 10, 0);
// }

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 132 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 6 ms 208 KB Output is correct
8 Correct 219 ms 208 KB Output is correct
9 Incorrect 202 ms 464 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 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 2 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 2 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 2 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 2 ms 976 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -