oj.uz

Submission #95964

# Submission time Handle Problem Language Result Execution time Memory
95964 2019-02-04T17:56:07 Z SuperJava Teleporters (IOI08_teleporters) C++17
25 / 100
 1000 ms 60740 KB 
//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
//endfold
#define  N  (200'005)
#define MOD (1000000000l + 7l)
#define OO (1050000000)
#define OOL (1100000000000000000)

//global

int ans(vector<int> a){
	int n = sz(a);
	vector<pair<int,int>> v(sz(a)/2,mp(-1,-1));
	rep(i,0,n){
		if(v[a[i]].first == -1) v[a[i]].first = i;
		else v[a[i]].second = i;
	}
	int coins = 0;
	int i = 0;
	while(i != n){
		if(i == v[a[i]].first) i = v[a[i]].second;
		else i = v[a[i]].first;
		coins++;
		i++;
	}
	return coins;
}

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	auto start = std::chrono::steady_clock::now();
	int n,m;
	cin >> n >> m;
	vector<int> a(2'000'010,-1);
	rep(i,0,n){
		int q,w;
		cin >> q >> w;
		a[q] = i;
		a[w] = i;
	}
	vector<int> z;
	rep(i,0,sz(a)){
		if(a[i] != -1) z.push_back(a[i]);
	}
	int mx = 0;
	vector<int> y(2*n,-1);
	rep(j,0,m){
		y.push_back(n+j);
		y.push_back(n+j);
	}
	rep(i,0,100000000){
		if(i&16383){
			auto elapsed = chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now( ) - start );
			if(elapsed.count() < 950) continue;
			else{
				cout << mx;
				return 0;
			}
		}
		shuffle(y.begin(), y.end(), rng);
		int r = 0;
		rep(j,0,sz(y)){
			if(y[j] == -1) y[j] = z[r++];
		}
		mx = max(mx,ans(y));
		rep(j,0,sz(y)){
			if(y[j] < n) y[j] = -1;
		}
	}
	cout << mx;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 931 ms 8184 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 924 ms 8184 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 933 ms 8184 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 934 ms 8184 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 935 ms 8184 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 926 ms 8184 KB Output isn't correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 932 ms 8184 KB Output isn't correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 925 ms 8184 KB Output isn't correct

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 923 ms 8184 KB Output isn't correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 933 ms 8184 KB Output isn't correct

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 932 ms 8188 KB Output isn't correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 940 ms 8568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 934 ms 8568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 950 ms 13456 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 929 ms 8940 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 949 ms 12788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1029 ms 28596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 44796 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 56976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 60740 KB Time limit exceeded
2 Halted 0 ms 0 KB -