Submission #1140517

#TimeUsernameProblemLanguageResultExecution timeMemory
1140517AbdullahIshfaqPetrol stations (CEOI24_stations)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
void solve(){
	int n, m;
    cin >> n >> m;
    vector<int> s(n), f(m);
	for(int i = 0 ;i < n; i ++){
		cin >> s[i];
	}
   	for(int i = 0 ;i < m; i ++){
		cin >> f[i];
	}
    int r = 0;
    for (int i = 0, j = 0; j < m; j++) {
        while (i < n - 2 and s[i + 1] < f[j]){
            i++;
		}
        r = max(r, min(abs(f[j] - s[i]), abs(f[j] - s[i + 1])));
    }
    cout << r << '\n';
    for (int i = 0; i < n; i += 3){
        cout << "LLR";
	}
    cout << '\n';
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ll tests = 1;
	// cin >> tests;
	for(ll i = 1; i <= tests; i++){
		solve();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...