답안 #1104072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104072 2024-10-22T16:10:43 Z asdfghjk Detecting Molecules (IOI16_molecules) C++14
0 / 100
1 ms 508 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define ld long double
#define S second
using namespace std;
const ll N = 4e5 + 5;
const ll NN = 4e5 + 5;
const ll INF = 1e18;
const ll inf = 1e9;
const ll MOD = 1e9 + 7;
vector <int> find_subset(int l,int r,vector <int> a){
    vector <int> ans;
    ans.clear();
    int n = a.size();
    int sum = 0;
    bool was=  0;
    for(int i = 0;i < n;i++){
        sum += a[i];
        ans.pb(i);
        if(sum >= l && sum <= r){
            break;
            was= 1;
        }
    }
    if(was == 0)ans.clear();
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Incorrect 1 ms 508 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Incorrect 1 ms 508 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Incorrect 1 ms 508 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Incorrect 1 ms 508 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 336 KB OK (n = 1, answer = NO)
3 Incorrect 1 ms 508 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -