oj.uz

답안 #339358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339358 2020-12-25T06:00:21 Z amunduzbaev 생물 실험 (IZhO13_expgorl) C++14
0 / 100
 1000 ms 512 KB 
/** made by amunduzbaev **/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/rope>

using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class tmp> bool umin(tmp& a, const tmp b) {return a > b? a = b, true:false;}
template<class tmp> bool umax(tmp& a, const tmp b) {return a < b? a = b, true:false;}

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int N = 1e7+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans, a[N];
ll gx, gy, lx, ly;
string s;

void solve(){
	cin>>k>>s;
	cin>>lx>>ly;
	cin>>gx>>gy;
	
	ll endx = gx, endy = gy;
	ld maxdis = (ld)sqrt(((endx - lx) * (endx - lx)) + ((endy - ly) * (endy - ly)));
	ld mindis = (ld)sqrt(((endx - lx) * (endx - lx)) + ((endy - ly) * (endy - ly)));
	for(ll j=0;j<k;j++){
		for(ll i=0;i<sz(s);i++){
			if(s[i] == 'L') endx--;
			else if(s[i] == 'R') endx++;
			else if(s[i] == 'F') endy++;
			else if(s[i] == 'B') endy--;
			else continue;
			umax(maxdis, (ld)sqrt(((endx - lx) * (endx - lx)) + ((endy - ly) * (endy - ly))));
			umin(mindis, (ld)sqrt(((endx - lx) * (endx - lx)) + ((endy - ly) * (endy - ly))));
		}
	}
	
	cout<<fixed<<setprecision(20)<<mindis<<" ";
	cout<<fixed<<setprecision(20)<<maxdis<<"\n";
	return;
}

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 492 KB Output is correct
2 Correct 240 ms 364 KB Output is correct
3 Correct 276 ms 364 KB Output is correct
4 Correct 292 ms 400 KB Output is correct
5 Correct 139 ms 364 KB Output is correct
6 Correct 211 ms 364 KB Output is correct
7 Correct 247 ms 512 KB Output is correct
8 Correct 339 ms 492 KB Output is correct
9 Execution timed out 1101 ms 364 KB Time limit exceeded
10 Halted 0 ms 0 KB -