oj.uz

답안 #240245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240245 2020-06-19T00:18:20 Z Amy313 Detecting Molecules (IOI16_molecules) C++14
0 / 100
 5 ms 256 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    vector<pair<int, int> >M;
    vector<int> A;
    int s = 0, n = w.size(), c;
    for(int i=0; i<w.size(); i++)
    {
        M.push_back(make_pair(w[i], i));
    }
    sort(M.begin(), M.end());
    A.clear();
    if(M[0].first>u)
	{
		return A;
	}
	int p1 = 0, p2 = 0;
	s = M[p2].first;
    for(int i=0; i<n; i++)
    {
        if(s>u)
		{
			s-=M[p1].first;
			s+=M[p2].first;
			p1++;
			p2++;
		}
		else
		{
			if(s>=l and s<=u)
			{
				break;
			}
			else
			{
				s+=M[p2].first;
				p2++;
			}
		}
    }
    if(s>u or s<l)
	{
		return A;
	}
	else
	{
		for(int i=p1; i<p2; i++)
		{
			A.push_back(M[i].second);
		}
		return A;
	}
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<w.size(); i++)
                  ~^~~~~~~~~
molecules.cpp:8:30: warning: unused variable 'c' [-Wunused-variable]
     int s = 0, n = w.size(), c;
                              ^

Subtask #1
0 / 9.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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