oj.uz

Submission #139535

# Submission time Handle Problem Language Result Execution time Memory
139535 2019-08-01T00:45:55 Z Boxworld Sails (IOI07_sails) C++14
60 / 100
 1000 ms 1420 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=100010;
pair<int,int> a[N];
int s[N],L[N];
int main(){
	int n,tmp=0,MX=0;
	scanf("%d",&n);
	for (int i=0;i<n;i++)scanf("%d%d",&a[i].first,&a[i].second);
	sort(a,a+n); 
	for (int i=0;i<n;i++){
		s[0]+=a[i].first-tmp;
		int cnt=a[i].second;
		for (int j=0;j<=MX;j++)
		if (cnt>s[j]){
			L[j+1]=s[j];
			cnt-=s[j];
			s[j]=0;
		}else{
			L[j+1]=cnt;
			s[j]-=cnt;
			cnt=0;
			break;
		}
		if (L[MX+1]>0)MX++;
		for (int j=0;j<=MX;j++)s[j]+=L[j],L[j]=0;
		tmp=a[i].first;
	}
	long long ans=0;
	for (int i=0;i<=n;i++)ans+=(long long)s[i]*i*(i-1)/2;
	printf("%lld\n",ans);
	return 0;
}

Compilation message

sails.cpp: In function 'int main()':
sails.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
sails.cpp:9:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0;i<n;i++)scanf("%d%d",&a[i].first,&a[i].second);
                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 464 KB Output is correct
2 Correct 740 ms 1148 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 892 KB Time limit exceeded

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 844 ms 916 KB Output is correct

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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