oj.uz

답안 #504076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
504076 2022-01-09T16:21:40 Z Newtech66 Detecting Molecules (IOI16_molecules) C++17
0 / 100
 0 ms 292 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
    int n=w.size();
    for(int i=0;i<n;i++)
    {
        if(l<=w[i] && w[i]<=u)
        {
            return {i};
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(l<=w[i]+w[j] && w[i]+w[j]<=u)
            {
                return {i,j};
            }
        }
    }
    return {};
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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