oj.uz

답안 #246696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246696 2020-07-09T22:05:36 Z rqi 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
49 / 100
 165 ms 55800 KB 
#include "garden.h"
#include "gardenlib.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}; 
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; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(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 
int fstTrue(function<bool(int)> f, int lo, int hi) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		int mid = (lo+hi)/2; 
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
 
// 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(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
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()
	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 << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#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
}
 
const int mx = 150005;
int N, M;
vpi elist[mx];
int to[mx*2];
vi from[mx*2];
int Q;
int G[mx];
int ans[mx];
int dists[mx];
vi rem[mx*2];
 
void dfs(int node, int dist, int start){
	if(node < N){
		dists[node] = dist;
	}
	for(auto u: from[node]){
		if(u == start) continue;
		dfs(u, dist+1, start);
	}
}
 
void solve(int node){
	//ps("solve", node);
	int curnode = node;
	int cyc = 0;
	for(int i = 0; i < 2*N+1; i++){
		cyc++;
		curnode = to[curnode];
		if(node == curnode) break;
	}
	if(cyc == 2*N+1){
		cyc = MOD;
	}
	for(int i = 0; i < N; i++){
		dists[i] = MOD;
	}
 
	dfs(node, 0, node);
 
	map<int, vi> m;
	//ps("cyc", cyc);
	for(int i = 0; i < 2*mx; i++){
		rem[i].clear();
	}
	for(int i = 0; i < N; i++){
		//ps(i, dists[i]);
		if(dists[i] != MOD) rem[dists[i] % cyc].pb(dists[i]);
	}

	for(int i = 0; i < 2*mx; i++){
		sort(all(rem[i]));
	}
 
	for(int i = 0; i < Q; i++){
		if(sz(rem[G[i] % cyc]) == 0) continue;
		if(rem[G[i] % cyc][0] > G[i]) continue;
 
		int lo = 0;
		int hi = sz(rem[G[i] % cyc])-1;
		while(lo < hi){
			int mid = (lo+hi)/2+1;
			if(rem[G[i] % cyc][mid] <= G[i]){
				lo = mid;
			}
			else hi = mid-1;
		}
		//ps(rem[G[i] % cyc], sz(rem[G[i] % cyc])-lo);
		ans[i]+=lo+1;
	}
}
 
void count_routes(int _N, int _M, int P, int R[][2], int _Q, int _G[]){
	N = _N;
	M = _M;
	Q = _Q;
	for(int i = 0; i < Q; i++){
		G[i] = _G[i];
	}
	for(int i = 0; i < M; i++){
		elist[R[i][0]].pb(mp(i, R[i][1]));
		elist[R[i][1]].pb(mp(i, R[i][0]));
	}
 
	for(int i = 0; i < N; i++){
		vi nodes;
		if(sz(elist[i]) == 1){
			nodes.pb(elist[i][0].s);
			nodes.pb(elist[i][0].s);
		}
		else{
			nodes.pb(elist[i][0].s);
			nodes.pb(elist[i][1].s);
		}
		for(int j = 0; j < 2; j++){
			int t = 0;
			if(elist[nodes[j]][0].s == i){
				t = 1;
			}
			to[i+j*N] = nodes[j]+t*N;
			//ps(i+j*N, to[i+j*N]);
		}
 
	}
 
	for(int i = 0; i < 2*N; i++){
		from[to[i]].pb(i);
	}
 
	//search for cycles with P, P+N
	solve(P); 
	solve(P+N);
 
	for(int i = 0; i < Q; i++){
		answer(ans[i]);
	}
}

Compilation message

garden.cpp: In function 'void setIn(std::__cxx11::string)':
garden.cpp:130: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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
garden.cpp: In function 'void setOut(std::__cxx11::string)':
garden.cpp:131: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
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 18176 KB Output is correct
2 Correct 20 ms 18048 KB Output is correct
3 Correct 17 ms 18048 KB Output is correct
4 Correct 16 ms 18048 KB Output is correct
5 Correct 17 ms 18048 KB Output is correct
6 Correct 17 ms 18176 KB Output is correct
7 Correct 17 ms 18048 KB Output is correct
8 Correct 18 ms 18176 KB Output is correct
9 Correct 27 ms 18432 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 18176 KB Output is correct
2 Correct 20 ms 18048 KB Output is correct
3 Correct 17 ms 18048 KB Output is correct
4 Correct 16 ms 18048 KB Output is correct
5 Correct 17 ms 18048 KB Output is correct
6 Correct 17 ms 18176 KB Output is correct
7 Correct 17 ms 18048 KB Output is correct
8 Correct 18 ms 18176 KB Output is correct
9 Correct 27 ms 18432 KB Output is correct
10 Correct 17 ms 17920 KB Output is correct
11 Correct 32 ms 20480 KB Output is correct
12 Correct 49 ms 22392 KB Output is correct
13 Correct 83 ms 39416 KB Output is correct
14 Correct 153 ms 32120 KB Output is correct
15 Correct 165 ms 33144 KB Output is correct
16 Correct 131 ms 30072 KB Output is correct
17 Runtime error 162 ms 55800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 18176 KB Output is correct
2 Correct 20 ms 18048 KB Output is correct
3 Correct 17 ms 18048 KB Output is correct
4 Correct 16 ms 18048 KB Output is correct
5 Correct 17 ms 18048 KB Output is correct
6 Correct 17 ms 18176 KB Output is correct
7 Correct 17 ms 18048 KB Output is correct
8 Correct 18 ms 18176 KB Output is correct
9 Correct 27 ms 18432 KB Output is correct
10 Correct 17 ms 17920 KB Output is correct
11 Correct 32 ms 20480 KB Output is correct
12 Correct 49 ms 22392 KB Output is correct
13 Correct 83 ms 39416 KB Output is correct
14 Correct 153 ms 32120 KB Output is correct
15 Correct 165 ms 33144 KB Output is correct
16 Correct 131 ms 30072 KB Output is correct
17 Runtime error 162 ms 55800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -