Submission #523778

#TimeUsernameProblemLanguageResultExecution timeMemory
523778vonatlusFireworks (APIO16_fireworks)C++17
0 / 100
1 ms204 KiB
/// adil sultanov | vonat1us #pragma GCC optimize("O3") //#pragma comment(linker, "/STACK:36777216") #include<bits/stdc++.h> #define x first #define y second #define pb push_back #define sz(x) (int) x.size() #define all(z) (z).begin(), (z).end() using namespace std; using ll = long long; using pii = pair<int, int>; const int MOD = 1e9 + 7; const int INF = 1e9 + 1e2; void fin() { #ifdef AM freopen(".in", "r", stdin); #endif } const bool flag = 0; const int N = 3e5+10; ll p[N], c[N]; void ma1n() { int n, m; cin >> n >> m; if (n == 1) { ll sum = 0; for (int i = 0; i < m; ++i) { cin >> p[i] >> c[i]; sum += c[i]; } ll x = sum/m, ans = (1ll<<50); for (ll i = max(0ll, x-50000); i <= x+50000; ++i) { ll res = 0; for (int j = 0; j < m; ++j) { res += abs(x-c[j]); } ans = min(ans, res); } cout << ans, exit(0); } } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr), fin(); int ts = 1; if (flag) { cin >> ts; } while (ts--) { ma1n(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...