| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 713386 | 2023-03-21T20:28:19 Z | ssense | Sails (IOI07_sails) | C++14 | 741 ms | 12836 KB |
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
int nw[100005];
void solve()
{
int n;
cin >> n;
vector<pair<int, int>> a(n);
for(int i = 0; i < n; i++)
{
cin >> a[i].fr >> a[i].sc;
}
sort(all(a));
map<int, int> mp;
int last = 0;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < a[i].fr-last; j++)
{
mp[0]++;
}
last = a[i].fr;
for(auto x : mp)
{
int have = x.sc-nw[x.fr];
if(a[i].sc >= have)
{
a[i].sc-=have;
mp[x.fr+1]+=have;
nw[x.fr+1] = have;
mp[x.fr] = x.sc-have;
}
else
{
mp[x.fr]-=a[i].sc;
mp[x.fr+1]+=a[i].sc;
break;
}
nw[x.fr] = 0;
}
}
long long ans = 0;
for(auto x : mp)
{
ans+=x.sc*(x.fr-1)*x.fr/2;
}
cout << ans << endl;
}
int32_t main(){
startt
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
/*
6
3 2
5 3
4 1
2 1
4 3
3 2
*/
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 33 ms | 11184 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | Output is correct |
| 2 | Correct | 0 ms | 212 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 34 ms | 11268 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 30 ms | 11168 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 34 ms | 11212 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 741 ms | 496 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 38 ms | 11728 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 44 ms | 12008 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 51 ms | 12432 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 51 ms | 12668 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 55 ms | 12836 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |