# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1045914 | 2024-08-06T08:30:06 Z | dilanyan | Sprinklers (CEOI24_sprinklers) | C++17 | 8 ms | 3396 KB |
//-------------dilanyan------------\\ #define _CRT_SECURE_NO_WARNINGS #include<bits/stdc++.h> #include<stdio.h> using namespace std; //------------------Kargpefines--------------------\\ #define ll long long #define pb push_back #define all(u) (u).begin(), (u).end() #define pqueue priority_queue #define upper upper_bound #define lower lower_bound #define umap unordered_map #define uset unordered_set void KarginSet(string name = "") { ios_base::sync_with_stdio(false); cin.tie(NULL); if (name.size()) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } } //-------------------KarginConstants------------------\\ const ll mod = 1e9 + 7; const ll inf = 2e9; //-------------------KarginCode-----------------------\\ const int N = 500005, M = 1000005; int s[N], f[N]; void KarginSolve() { int n, m; cin >> n >> m; for (int i = 0;i < n;i++) cin >> s[i]; for (int i = 0;i < m;i++) cin >> f[i]; if (n == 1) { if (s[0] <= f[0]) { cout << f[m - 1] - s[0] << '\n'; cout << "R\n"; } else if (s[0] >= f[m - 1]) { cout << s[0] - f[0] << '\n'; cout << "L\n"; } else cout << -1 << '\n'; } } int main() { KarginSet(); int test = 1; //cin >> test; while (test--) { KarginSolve(); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2396 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Correct |
2 | Correct | 6 ms | 2652 KB | Correct |
3 | Correct | 0 ms | 2396 KB | Correct |
4 | Correct | 6 ms | 3396 KB | Correct |
5 | Correct | 8 ms | 3252 KB | Correct |
6 | Correct | 1 ms | 2396 KB | Correct |
7 | Correct | 0 ms | 2396 KB | Correct |
8 | Correct | 1 ms | 2644 KB | Correct |
9 | Correct | 0 ms | 2516 KB | Correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2396 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2396 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2396 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2396 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |