oj.uz

Submission #121839

# Submission time Handle Problem Language Result Execution time Memory
121839 2019-06-27T06:41:26 Z turbat Sails (IOI07_sails) C++14
80 / 100
 1000 ms 3840 KB 
#include <bits/stdc++.h>
using namespace std;
#define N 100005

int n, mh;
long long  sum, cnt[N], s[N], ans, p, uld, avr;
pair <int, int> mast[N];

void solve (int l){
  if (l > mh) return;
  p = l;
  // cout << l<< endl;
  long long th = mh;
  for (int i = l;i <= mh;i++)
    if((s[i] - s[l - 1]) * (p - l + 1) >= (s[p] - s[l - 1]) * (i - l + 1)){
      p = i;
      th = ((s[th] - s[l - 1]) * (i - l + 1)) / (s[i] - s[l - 1]); 
    }
  sum = s[p] - s[l - 1];
  avr = sum / (p - l + 1);
  uld = sum % (p - l + 1);
  ans += uld * avr;
  ans += (p - l + 1) * avr * (avr - 1) / 2;
  solve (p + 1);
}

int main (){
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0;i < n;i++){
    cin >> mast[i].first>> mast[i].second;
    mh = max(mh, mast[i].first);
    cnt[mast[i].first + 1]--;
    cnt[mast[i].first - mast[i].second + 1]++;
  }
  p = 1;
  for (int i = 1;i <= mh;i++) { 
    cnt[i] += cnt[i - 1];
    s[i] = s[i - 1] + cnt[i];
    if(s[i] * p >= s[p] * i)
      p = i;
  }
  avr = s[p] / p;
  uld = s[p] % p;
  ans += uld * avr;
  ans += p * avr * (avr - 1) / 2;
  solve (p + 1);
  cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 896 KB Output is correct
2 Correct 14 ms 896 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 1408 KB Time limit exceeded

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 2048 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3320 KB Output is correct
2 Correct 20 ms 3320 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 3576 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 3840 KB Output is correct
2 Correct 18 ms 2560 KB Output is correct