답안 #133359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
133359	2019-07-20T12:35:17 Z	rajarshi_basu	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	3 ms	380 KB

molecules

#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <unordered_map>
#include <fstream>
#include <complex>
#include <random>
#include <stack>
#include <chrono>
#include <set>

#include "molecules.h"
 
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define ld long double
#define pld pair<ld,ld>
#define iii pair<ii,int>
#define vv vector
 
using namespace std;

const int MAXN = 500000 + 10;

vi find_subset(int l,int u,vi w){
	int n = w.size();
	int lptr = 0;
	vv<ii> ids;
	FOR(i,n)ids.pb({w[i],i});
	sort(ids.begin(), ids.end());
	ll sum = 0;
	FOR(i,n){
		sum += ids[i].ff;
		if(l <= sum and sum <= u){
			vi t;
			FORE(j,lptr,i){
				t.pb(ids[j].ss);
			}
			sort(t.begin(), t.end());
			return t;
		}
		while(sum > u){
			sum -= ids[lptr++].ff;
			if(lptr > i)break;
		}
	}
	vi x;
	return x;
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	3 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	380 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	252 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	376 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	376 KB	OK (n = 1, answer = NO)
3	Correct	3 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	380 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	252 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Incorrect	2 ms	376 KB	Contestant can not find answer, jury can
21	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	376 KB	OK (n = 1, answer = NO)
3	Correct	3 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	380 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	252 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Incorrect	2 ms	376 KB	Contestant can not find answer, jury can
21	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	376 KB	OK (n = 1, answer = NO)
3	Correct	3 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	380 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	252 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Incorrect	2 ms	376 KB	Contestant can not find answer, jury can
21	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	376 KB	OK (n = 1, answer = NO)
3	Correct	3 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	380 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	252 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Incorrect	2 ms	376 KB	Contestant can not find answer, jury can
21	Halted	0 ms	0 KB	-