oj.uz

답안 #634932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634932 2022-08-25T09:08:50 Z pragmatist 생물 실험 (IZhO13_expgorl) C++17
0 / 100
 1000 ms 308 KB 
#pragma GCC optimize("O3", "Ofast", "unroll-loops") 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include<bits/stdc++.h>
 
#define ll long long
#define pb push_back
#define x first
#define y second
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define ld long double
#define nl "\n"

using namespace std;
using pii = pair<int, int>;
 
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
const int MOD = (int)1e9 + 7;
const int M = (int)5e4 + 7; 

int k, Lx, Ly, Gx, Gy;
string a;

ll dist(int x1, int y1, int x2, int y2) {
	return 1ll * (x1 - x2) * (x1 - x2) + 1ll * (y1 - y2) * (y1 - y2);
}

void solve() {
	cin >> k >> a >> Lx >> Ly >> Gx >> Gy;
	ll mn = INF, mx = -INF;
	mn = min(mn, dist(Gx, Gy, Lx, Ly));
	mx = max(mx, dist(Gx, Gy, Lx, Ly));
	while(k--) {
		for(auto x : a) {
			if(x == 'L') Gx--;
			if(x == 'R') Gx++;
			if(x == 'F') Gy++;
			if(x == 'B') Gy--;
			mn = min(mn, dist(Gx, Gy, Lx, Ly));
			mx = max(mx, dist(Gx, Gy, Lx, Ly));
		}
	}
	
	cout << fixed << setprecision(9) << sqrt(mn) << ' ' << sqrt(mx) << nl;
}
 
signed main() {
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cout.tie(0);
	int test = 1;
	//cin >> test;
	while(test--) {
		solve();
	}
	return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 212 KB Output is correct
2 Correct 62 ms 212 KB Output is correct
3 Correct 71 ms 296 KB Output is correct
4 Correct 77 ms 300 KB Output is correct
5 Correct 37 ms 308 KB Output is correct
6 Correct 54 ms 296 KB Output is correct
7 Correct 63 ms 296 KB Output is correct
8 Correct 86 ms 292 KB Output is correct
9 Execution timed out 1098 ms 212 KB Time limit exceeded
10 Halted 0 ms 0 KB -