oj.uz

Submission #121844

# Submission time Handle Problem Language Result Execution time Memory
121844 2019-06-27T06:46:30 Z turbat Sails (IOI07_sails) C++14
80 / 100
 1000 ms 2724 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 = min (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 512 KB Output is correct
2 Correct 3 ms 1920 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 896 KB Output is correct
2 Correct 13 ms 640 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 1024 KB Time limit exceeded

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 1656 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2552 KB Output is correct
2 Correct 19 ms 2556 KB Output is correct

Subtask #10
0 / 10.0

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

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 2724 KB Output is correct
2 Correct 19 ms 1656 KB Output is correct