oj.uz

Submission #361750

# Submission time Handle Problem Language Result Execution time Memory
361750 2021-01-31T13:58:39 Z ryansee Stations (IOI20_stations) C++14
8 / 100
 1003 ms 992 KB 
#include "stations.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)

vector<int> label(int n, int k, vector<int> U, vector<int> V) {
	FOR(i,0,n-2) assert((U[i] == i+1 && V[i] == i/2) || (V[i] == i+1 && U[i] == i/2));
	vector<int> C(n, 0);
	FOR(i,0,n-1) C[i]=i;
	return C;
}

int find_next_station(int s, int t, vector<int> c) {
	if(s > t) {
		return *min_element(all(c));
	} else {
		while((t-1) / 2 > s) {
			-- t, t /= 2;
		}
		if(((t - 1)/ 2) ^ s) return *min_element(all(c));
		assert(find(all(c), t) != c.end());
		return t;
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 840 KB Output is correct
2 Correct 545 ms 876 KB Output is correct
3 Correct 933 ms 992 KB Output is correct
4 Correct 739 ms 884 KB Output is correct
5 Correct 678 ms 884 KB Output is correct
6 Correct 466 ms 756 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1003 ms 884 KB Output is correct
2 Runtime error 1 ms 492 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -