oj.uz

답안 #1077676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077676 2024-08-27T08:33:47 Z speedcode Detecting Molecules (IOI16_molecules) C++17
0 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> find_subset(int l, int u, vector<int> w){
    int n = w.size();
    vector<pair<int, int>> dat(n);
    for(int i = 0; i < n; i++){
        dat[i] = {w[i], i};
    }
    sort(dat.begin(), dat.end());
    ll s1 = dat[0].first;
    ll s2 = dat[n-1].first;
    int k = 1;
    while(k <= n){
        if(s1 > l || s2 < u){
            k++;
            s1 += dat[k-1].first;
            s2 += dat[n-k].first;
        }else{
            vector<int> result(k);
            int ind = 0;
            for(int i = 0; i < k; i++){
                result[i] = dat[i].second;
            }
            while(s1 < u){
                s1 -= dat[ind].first;
                s1 += dat[n-ind-1].first;
                result[ind] = dat[n-ind-1].second;
                ind++;
            }
            return result;
        }
    }

    return {};
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 436 KB OK (n = 1, answer = YES)
4 Correct 1 ms 600 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Incorrect 0 ms 428 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB OK (n = 12, answer = YES)
2 Correct 1 ms 348 KB OK (n = 12, answer = YES)
3 Correct 0 ms 348 KB OK (n = 12, answer = NO)
4 Correct 1 ms 348 KB OK (n = 12, answer = NO)
5 Incorrect 0 ms 348 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 436 KB OK (n = 1, answer = YES)
4 Correct 1 ms 600 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Incorrect 0 ms 428 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 436 KB OK (n = 1, answer = YES)
4 Correct 1 ms 600 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Incorrect 0 ms 428 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 436 KB OK (n = 1, answer = YES)
4 Correct 1 ms 600 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Incorrect 0 ms 428 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 436 KB OK (n = 1, answer = YES)
4 Correct 1 ms 600 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Incorrect 0 ms 428 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -