# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
493872 | 2021-12-13T09:12:21 Z | BreakOfDawn | Fireworks (APIO16_fireworks) | C++14 | 1 ms | 312 KB |
/* 🛸 🌎 ° 🌓 • .°• 🚀 ✯ ★ * ° 🛰 °· 🪐 . • ° ★ • ☄ ______________________________________________________ You are watching a brute force code CODE IS WRITTEN BY 13MINUSONE */ #include<bits/stdc++.h> using namespace std; #define task "c9" #define SZ(c) c.size() #define getbit(x,i) (((x) >> (i)) & 1) #define turnoff(x,i) (x)&(~(1<<(i))) #define mu2(x) (1<<x) #define __builtin_popcount __builtin_popcountll #define all(x) x.begin(),x.end() #define endl '\n' #define fi first #define se second typedef long long ll ; typedef pair<int,int> ii; typedef vector<ll> vll; typedef vector<int> vi; template<class X, class Y> bool minimize(X &x, const Y &y) { X eps = 1e-9; if (x > y + eps) { x = y; return true; } else return false; } template<class X, class Y> bool maximize(X &x, const Y &y) { X eps = 1e-9; if (x + eps < y) { x = y; return true; } else return false; } template<class T> T Abs(const T &x) { return (x < 0 ? -x : x); } const ll N = 1e5 + 5; const ll mod =1e9+9; const ll base = 311; const int block = 488; void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void inti() { if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } } int n,m; ll ans=0; void nhap() { cin >> n >> m; if (n == 1) { vector<long long> cs; for (int i = 1; i < n + m; i++) { int p; long long c; cin >> p >> c; cs.emplace_back(c); } sort(cs.begin(), cs.end()); long long loc = cs[cs.size() / 2]; long long ans = 0; for (int i = 0; i < (int) cs.size(); i++) { ans += abs(loc - cs[i]); } cout << ans << '\n'; return ; } } int main() { fastio(); inti(); nhap(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 312 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 312 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 1 ms | 204 KB | Output is correct |
10 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 312 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 312 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 1 ms | 204 KB | Output is correct |
10 | Correct | 0 ms | 204 KB | Output is correct |
11 | Incorrect | 0 ms | 204 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 312 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 312 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 1 ms | 204 KB | Output is correct |
10 | Correct | 0 ms | 204 KB | Output is correct |
11 | Incorrect | 0 ms | 204 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |