oj.uz

답안 #75760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
75760 2018-09-11T04:49:36 Z Sherazin Detecting Molecules (IOI16_molecules) C++14
0 / 100
 2 ms 536 KB 
#include "molecules.h"
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

vector<pii> V;
vector<int> ans;

vector<int> find_subset(int l, int u, vector<int> w) {
	for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
	sort(w.begin(), w.end());
	int L = 0, R = 0;
	long long sum = 0;
	while(L < w.size()) {
		while(R < w.size() && sum < L) sum += (long long)w[R++];
		if(l <= sum && sum <= u) {
			for(int i = L; i < R; i++) ans.emplace_back(i);
			return ans;
		}
		sum -= (long long)w[L++];
	}
	return {};
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
                 ~~^~~~~~~~~~
molecules.cpp:18:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(L < w.size()) {
        ~~^~~~~~~~~~
molecules.cpp:19:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(R < w.size() && sum < L) sum += (long long)w[R++];
         ~~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 536 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 536 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 536 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 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 536 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 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 536 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 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Incorrect 2 ms 536 KB Contestant can not find answer, jury can
4 Halted 0 ms 0 KB -