oj.uz

답안 #164668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164668 2019-11-22T12:54:09 Z aggu_01000101 Detecting Molecules (IOI16_molecules) C++14
0 / 100
 2 ms 376 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> arr){
    vector<pair<int, int>> arr1;
    for(int i = 0;i<arr.size();i++){
        arr1.push_back(make_pair(arr[i], i));
    }
    sort(arr1.begin(), arr1.end());
    vector<int> answer;
    int first = 0, last = 1;
    int sum = 0;
    while(last<arr1.size() && first<arr.size()){
        if(sum>=l && sum<=u){
            for(int i = first;i<last;i++){
                answer.push_back(arr1[i].second+1);
            }
            goto returnanswer;
        }
        else if(sum<l){
            sum+=arr1[last].first;
            last++;
        }
        else{
            sum-=arr1[first].first;
            first++;
        }
    }
    returnanswer:
    return answer;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:7:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<arr.size();i++){
                   ~^~~~~~~~~~~
molecules.cpp:14:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(last<arr1.size() && first<arr.size()){
           ~~~~^~~~~~~~~~~~
molecules.cpp:14:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(last<arr1.size() && first<arr.size()){
                               ~~~~~^~~~~~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB sum of weights should be in [302..304] but it is 353
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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