# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
935674 |
2024-02-29T11:09:30 Z |
GrindMachine |
Rail (IOI14_rail) |
C++17 |
|
206 ms |
1004 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 = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "rail.h"
int query(int i, int j){
if(i == j) return 0;
return getDistance(i,j);
}
void findLocation(int n, int first, int location[], int stype[])
{
rep(i,n){
location[i] = -1;
stype[i] = -1;
}
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());
// left
if(i != first_right){
if(query(0,first_right)+query(first_right,i) == query(0,i)){
conts;
}
}
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] = 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;
// }
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
512 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
600 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
201 ms |
852 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
206 ms |
1004 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |