oj.uz

답안 #102157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102157 2019-03-23T02:21:56 Z royyaha Detecting Molecules (IOI16_molecules) C++11
0 / 100
 3 ms 384 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
#define rep(i, a, n) for(int i = a; i < n; ++i)
#define rep0(i, n) rep(i, 0, n)
#define rep1(i, n) rep(i, 1, n+1)
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define IOS cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define _ << " " << 
#define endl '\n'
#define wer(x) cout << (#x) << "->" << (x) << endl;
#define we(x) (#x) << ":(" << x << ") "
//////////////////////////////////////////////////////////////////
#define __lg(i) log(i) / log(2)
 
const int maxn = 2e5+50;
vector<ii> item;
 
vector<int> find_subset(int l, int r, vector<int> w) {
	int n = (int) w.size();
	rep0(i, n) item.eb(w[i], i+100);
	sort(item.begin(), item.end());
	vector<int> ans;
	queue<ii> q;
	int sum = 0;
	for(auto i : item) {
		while(q.empty() != false && i.fs - q.front().fs > r - l) sum -= q.front().fs, q.pop();
		q.push(i); sum += i.fs;
		while(q.empty() != false && sum > r) {
			sum -= q.front().fs, q.pop();
		}
		if(sum >= l) {
			while(q.empty() != false) {
				ans.pb(q.front().sc);
				q.pop();
			}
		}
	}
	sort(ans.begin(), ans.end());
	return ans;
 
 
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Incorrect 2 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Incorrect 2 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Incorrect 2 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Incorrect 2 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Incorrect 2 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -