oj.uz

Submission #935683

# Submission time Handle Problem Language Result Execution time Memory
935683 2024-02-29T11:21:22 Z GrindMachine Rail (IOI14_rail) C++17
56 / 100
 265 ms 99028 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "rail.h"

int dp[N][N];
int q = 0;
int currn;

int query(int i, int j){
	if(i == j) return 0;
	if(dp[i][j] != -1){
		return dp[i][j];
	}
	q++;
	assert(q <= currn*(currn-1)/2);
	return dp[i][j] = getDistance(i,j);
}

void findLocation(int n, int first, int location[], int stype[])
{
	rep(i,n){
		location[i] = -1;
		stype[i] = -1;
	}

	memset(dp,-1,sizeof dp);
	currn = n;

	location[0] = first;
	stype[0] = 1;

	if(n == 1) return;

	// find the guys to the right
	set<pii> st;
	rep1(i,n-1){
		st.insert({query(0,i),i});
	}

	int first_right = st.begin()->second;

	while(!st.empty()){
		auto [dis,i] = *st.begin();
		st.erase(st.begin());

		location[i] = first+dis;
		stype[i] = 2;

		// right
		vector<pll> torem;
		for(auto [dis2,j] : st){
			// does j lie in between a[0] and i? (j is type C)
			if(query(0,i)+query(i,j) == query(0,j)){
				// cout << i << " " << j << endl;
				torem.pb({dis2,j});
				location[j] = first+query(0,i)-query(i,j);
				stype[j] = 1;
			}
		}

		trav(p,torem){
			st.erase(p);
		}
	}

	// find the guys to the left
	rep(i,n){
		if(location[i] < first){
			st.insert({query(0,i)-2*query(0,first_right),i});
		}
	}

	while(!st.empty()){
		auto [dis,i] = *st.begin();
		st.erase(st.begin());

		location[i] = first-dis;
		stype[i] = 1;

		vector<pll> torem;
		for(auto [dis2,j] : st){
			// does j lie in between a[0] and i? (j is type D)
			if(query(first_right,i)+query(i,j) == query(first_right,j)){
				torem.pb({dis2,j});
				location[j] = location[i]+query(i,j);
				stype[j] = 2;
			}
		}

		trav(p,torem){
			st.erase(p);
		}
	}

	// cout << endl;
	// rep(i,n){
	// 	cout << stype[i] << " " << location[i] << endl;
	// }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 98396 KB Output is correct
2 Correct 14 ms 98392 KB Output is correct
3 Correct 13 ms 98332 KB Output is correct
4 Correct 14 ms 98508 KB Output is correct
5 Correct 13 ms 98396 KB Output is correct
6 Correct 14 ms 98492 KB Output is correct
7 Correct 16 ms 98396 KB Output is correct
8 Correct 14 ms 98396 KB Output is correct
9 Correct 14 ms 98388 KB Output is correct
10 Correct 14 ms 98392 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 98396 KB Output is correct
2 Correct 14 ms 98396 KB Output is correct
3 Correct 14 ms 98540 KB Output is correct
4 Correct 14 ms 98396 KB Output is correct
5 Correct 14 ms 98652 KB Output is correct
6 Correct 13 ms 98396 KB Output is correct
7 Correct 13 ms 98396 KB Output is correct
8 Correct 13 ms 98396 KB Output is correct
9 Correct 16 ms 98572 KB Output is correct
10 Correct 14 ms 98396 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 98996 KB Output is correct
2 Correct 168 ms 98900 KB Output is correct
3 Correct 154 ms 99024 KB Output is correct
4 Correct 148 ms 98900 KB Output is correct
5 Correct 187 ms 98936 KB Output is correct
6 Correct 224 ms 98916 KB Output is correct
7 Correct 172 ms 98900 KB Output is correct
8 Correct 154 ms 98912 KB Output is correct
9 Correct 150 ms 99028 KB Output is correct
10 Correct 156 ms 98896 KB Output is correct

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 98896 KB Output is correct
2 Correct 161 ms 98896 KB Output is correct
3 Correct 160 ms 98896 KB Output is correct
4 Correct 151 ms 98900 KB Output is correct
5 Correct 183 ms 98940 KB Output is correct
6 Correct 265 ms 98868 KB Output is correct
7 Correct 176 ms 98952 KB Output is correct
8 Correct 152 ms 98940 KB Output is correct
9 Correct 152 ms 98896 KB Output is correct
10 Correct 157 ms 98896 KB Output is correct
11 Incorrect 181 ms 98940 KB Output isn't correct
12 Halted 0 ms 0 KB -