oj.uz

Submission #335217

# Submission time Handle Problem Language Result Execution time Memory
335217 2020-12-11T14:47:13 Z rqi Brunhilda’s Birthday (BOI13_brunhilda) C++14
0 / 100
 291 ms 262148 KB 
#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<bool> vb; 
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 sor(x) sort(all(x)) 
#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}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

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; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
	// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi);
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi+1);
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
template<class T> void remDup(vector<T>& v) { 
	sort(all(v)); v.erase(unique(all(v)),end(v)); }

// 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
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+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 A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
template<class A, class B> str ts(pair<A,B> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// 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 << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str 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
}

int m, Q;
int p[100005];

const int mx = 10000005;
int curlef = 0;
int mults[mx];
vi updates[mx];
int ans[mx];

int main() {
	setIO();
	cin >> m >> Q;
	for(int i = 1; i <= m; i++){
		cin >> p[i];
	}

	curlef = 0;
	for(int i = 1; i <= m; i++){
		mults[0]++;
		updates[p[i]].pb(0);
	}
	ans[0] = 0;

	for(int i = 1; i <= 10000000; i++){
		while(sz(updates[i])){
			int lastpos = updates[i].bk;
			int nexpos = i+(i-lastpos);

			mults[lastpos]--;
			mults[i]++;

			updates[i].pop_back();
			if(nexpos < mx){
				updates[nexpos].pb(i);
			}
		}

		while(curlef <= i){
			if(mults[curlef] > 0) break;
			curlef++;
		}

		if(curlef == i){
			ans[i] = MOD;
		}
		else{
			ans[i] = ans[curlef]+1;
		}

	}

	for(int i = 1; i <= Q; i++){
		int n;
		cin >> n;
		if(ans[n] >= MOD){
			ps("oo");
		}
		else ps(ans[n]);
	}

	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

brunhilda.cpp: In function 'void setIn(str)':
brunhilda.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
brunhilda.cpp: In function 'void setOut(str)':
brunhilda.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 181 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 208 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Runtime error 188 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Runtime error 187 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Runtime error 200 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 182 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 186 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 200 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 210 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 214 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
11 Runtime error 205 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Runtime error 196 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Runtime error 241 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Runtime error 249 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
15 Runtime error 202 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
16 Runtime error 232 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Runtime error 214 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
18 Runtime error 195 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 220 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 229 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Runtime error 287 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Runtime error 213 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Runtime error 245 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 195 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 215 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 208 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 250 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 282 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
11 Runtime error 284 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Runtime error 228 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Runtime error 202 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Runtime error 206 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
15 Runtime error 259 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
16 Runtime error 225 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Runtime error 248 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
18 Runtime error 252 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Runtime error 275 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 288 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Runtime error 287 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Runtime error 226 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Runtime error 240 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 256 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 239 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 262 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 268 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 232 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
11 Runtime error 224 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Runtime error 244 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Runtime error 290 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Runtime error 220 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
15 Runtime error 250 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
16 Runtime error 261 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Runtime error 249 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
18 Runtime error 275 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
19 Runtime error 196 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Runtime error 291 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Runtime error 230 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
22 Runtime error 277 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
23 Runtime error 232 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
24 Runtime error 200 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
25 Runtime error 228 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
26 Runtime error 225 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
27 Runtime error 288 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
28 Runtime error 200 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
29 Runtime error 249 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
30 Runtime error 241 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
31 Runtime error 212 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
32 Runtime error 215 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
33 Runtime error 191 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
34 Runtime error 235 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
35 Runtime error 206 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Runtime error 271 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
37 Runtime error 243 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
38 Runtime error 249 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Runtime error 201 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Runtime error 242 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
41 Runtime error 237 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Runtime error 254 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)