/// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
namespace s2 {
ll get(vector <int> &r, vector <int> &b) {
ll res = 0;
int n = min(sz(r), sz(b));
rep(i, 0, n - 1) res += b[i] - r[i];
if (sz(r) > sz(b)) {
rep(i, n, sz(r) - 1) res += b[0] - r[i];
}
if (sz(r) < sz(b)) {
rep(i, n, sz(b) - 1) res += b[i] - r.back();
}
return res;
}
}
ll min_total_length(vector <int> r, vector <int> b) {
if (r.back() < b[0]) return s2 :: get(r, b);
}
#ifdef IOI2018
namespace read {
void read() {
int n, m;
assert(2 == scanf("%d %d", &n, &m));
vector<int> r(n), b(m);
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &r[i]));
for(int i = 0; i < m; i++)
assert(1 == scanf("%d", &b[i]));
long long res = min_total_length(r, b);
printf("%lld\n", res);
ioi
}
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
read :: read();
ioi
}
#endif
Compilation message
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '2240' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
356 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
27 ms |
1664 KB |
Output is correct |
4 |
Correct |
33 ms |
1588 KB |
Output is correct |
5 |
Correct |
25 ms |
1656 KB |
Output is correct |
6 |
Correct |
39 ms |
2048 KB |
Output is correct |
7 |
Correct |
35 ms |
2040 KB |
Output is correct |
8 |
Correct |
34 ms |
2052 KB |
Output is correct |
9 |
Correct |
46 ms |
2040 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
356 KB |
Output is correct |
2 |
Incorrect |
2 ms |
384 KB |
3rd lines differ - on the 1st token, expected: '17703', found: '0' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
3rd lines differ - on the 1st token, expected: '27', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '2240' |
2 |
Halted |
0 ms |
0 KB |
- |