oj.uz

Submission #213398

# Submission time Handle Problem Language Result Execution time Memory
213398 2020-03-25T17:20:06 Z rqi Detecting Molecules (IOI16_molecules) C++14
9 / 100
 5 ms 512 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<ll> v;
	for(auto u: w){
		v.pb(ll(u));
	}
	sort(all(v));
	ll L = ll(l);
	ll R = ll(u);
	ll lsum = 0;
	ll rsum = 0;
	vi ans;
	for(int i = 0; i < sz(v); i++){
		lsum+=v[i];
		rsum+=v[sz(v)-1-i];
		ans.pb(i);
		if(lsum > R) break;
		if(rsum >= L){

			int num = i+1; // number of elements in ans
			if(rsum <= R){
				for(int i = 0; i < num; i++){
					ans[i] = sz(v)-1-i;
				}
				return ans;
			}
			ll sum = lsum;
			for(int i = num-1; i >= 0; i--){
				if(sum+v[i-num+sz(v)]-v[i] <= R){
					ans[i] = i-num+sz(v);
					sum = sum+v[i-num+sz(v)]-v[i];
					continue;
				}
				for(int j = i; j <= sz(v); j++){
					if(sum+v[j]-v[i] >= L){
						ans[i] = j;
						return ans;
					}
				}
			}
			assert(0 == 1);
			return ans;
		}
	}
    return {};
}

Compilation message

molecules.cpp: In function 'void setIn(std::__cxx11::string)':
molecules.cpp:124:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
molecules.cpp: In function 'void setOut(std::__cxx11::string)':
molecules.cpp:125:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 5 ms 512 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 384 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 5 ms 128 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 12, answer = YES)
2 Correct 5 ms 384 KB OK (n = 12, answer = YES)
3 Correct 5 ms 384 KB OK (n = 12, answer = NO)
4 Correct 4 ms 384 KB OK (n = 12, answer = NO)
5 Correct 5 ms 384 KB OK (n = 12, answer = YES)
6 Correct 5 ms 384 KB OK (n = 12, answer = YES)
7 Correct 5 ms 384 KB OK (n = 12, answer = YES)
8 Correct 5 ms 384 KB OK (n = 12, answer = YES)
9 Correct 5 ms 384 KB OK (n = 6, answer = YES)
10 Correct 5 ms 384 KB OK (n = 12, answer = YES)
11 Correct 5 ms 384 KB OK (n = 100, answer = NO)
12 Incorrect 5 ms 384 KB sum of weights should be in [50..51] but it is 35
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 5 ms 512 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 384 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 5 ms 128 KB OK (n = 100, answer = YES)
20 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 5 ms 384 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 4 ms 384 KB OK (n = 12, answer = NO)
24 Correct 5 ms 384 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 384 KB OK (n = 6, answer = YES)
29 Correct 5 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 384 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 5 ms 512 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 384 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 5 ms 128 KB OK (n = 100, answer = YES)
20 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 5 ms 384 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 4 ms 384 KB OK (n = 12, answer = NO)
24 Correct 5 ms 384 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 384 KB OK (n = 6, answer = YES)
29 Correct 5 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 384 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 5 ms 512 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 384 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 5 ms 128 KB OK (n = 100, answer = YES)
20 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 5 ms 384 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 4 ms 384 KB OK (n = 12, answer = NO)
24 Correct 5 ms 384 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 384 KB OK (n = 6, answer = YES)
29 Correct 5 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 384 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 5 ms 512 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 384 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 5 ms 128 KB OK (n = 100, answer = YES)
20 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 5 ms 384 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 4 ms 384 KB OK (n = 12, answer = NO)
24 Correct 5 ms 384 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 5 ms 384 KB OK (n = 6, answer = YES)
29 Correct 5 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 384 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -