oj.uz

Submission #254051

# Submission time Handle Problem Language Result Execution time Memory
254051 2020-07-29T09:28:15 Z TadijaSebez Naan (JOI19_naan) C++11
29 / 100
 320 ms 74104 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2005;
struct frac{
	ll p,q;
	frac():p(0),q(1){}
	frac(ll a,ll b=1):p(a),q(b){}
	frac operator+(frac b){return frac(p*b.q+b.p*q,q*b.q);}
	bool operator<(frac b){return p*b.q<b.p*q;}
}p[N][N];
int v[N][N],sum[N],ans[N];
bool was[N];
int main(){
	int n,l;
	scanf("%i %i",&n,&l);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=l;j++){
			scanf("%i",&v[i][j]);
			sum[i]+=v[i][j];
			v[i][j]*=n;
		}
		for(int j=1,ptr=1,take=0;j<=n;j++){
			int need=sum[i];
			while(v[i][ptr]-take<need){
				need-=v[i][ptr]-take;
				take=0;
				ptr++;
			}
			p[i][j]=frac(ptr-1)+frac(take+need,v[i][ptr]);
			take+=need;
		}
	}
	for(int i=1;i<=n;i++){
		frac mn=frac(l+1);
		int k;
		for(int j=1;j<=n;j++)if(!was[j]){
			if(p[j][i]<mn){
				mn=p[j][i];
				k=j;
			}
		}
		if(i!=n)printf("%lld %lld\n",mn.p,mn.q);
		ans[i]=k;
		was[k]=1;
	}
	for(int i=1;i<=n;i++)printf("%i ",ans[i]);
	return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&l);
  ~~~~~^~~~~~~~~~~~~~~
naan.cpp:19:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%i",&v[i][j]);
    ~~~~~^~~~~~~~~~~~~~~
naan.cpp:44:9: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   ans[i]=k;
   ~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 63360 KB Output is correct
2 Correct 49 ms 63224 KB Output is correct
3 Correct 32 ms 63224 KB Output is correct
4 Correct 33 ms 63228 KB Output is correct
5 Correct 30 ms 63224 KB Output is correct
6 Correct 33 ms 63252 KB Output is correct
7 Correct 35 ms 63232 KB Output is correct
8 Correct 30 ms 63320 KB Output is correct
9 Correct 35 ms 63224 KB Output is correct
10 Correct 31 ms 63228 KB Output is correct
11 Correct 37 ms 63224 KB Output is correct
12 Correct 30 ms 63232 KB Output is correct
13 Correct 35 ms 63224 KB Output is correct
14 Correct 30 ms 63232 KB Output is correct
15 Correct 35 ms 63224 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 63224 KB Output is correct
2 Correct 36 ms 63228 KB Output is correct
3 Correct 31 ms 63360 KB Output is correct
4 Correct 33 ms 63360 KB Output is correct
5 Correct 31 ms 63360 KB Output is correct
6 Correct 32 ms 63232 KB Output is correct
7 Correct 30 ms 63232 KB Output is correct
8 Correct 30 ms 63224 KB Output is correct
9 Correct 35 ms 63360 KB Output is correct
10 Correct 31 ms 63360 KB Output is correct
11 Correct 30 ms 63360 KB Output is correct
12 Correct 30 ms 63232 KB Output is correct
13 Correct 34 ms 63288 KB Output is correct
14 Correct 34 ms 63272 KB Output is correct
15 Correct 30 ms 63360 KB Output is correct
16 Correct 33 ms 63360 KB Output is correct
17 Correct 31 ms 63352 KB Output is correct
18 Correct 31 ms 63360 KB Output is correct
19 Correct 31 ms 63352 KB Output is correct
20 Correct 33 ms 63256 KB Output is correct
21 Correct 34 ms 63304 KB Output is correct
22 Correct 30 ms 63352 KB Output is correct
23 Correct 29 ms 63224 KB Output is correct
24 Correct 35 ms 63360 KB Output is correct
25 Correct 33 ms 63224 KB Output is correct
26 Correct 37 ms 63224 KB Output is correct
27 Correct 32 ms 63268 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 63360 KB Output is correct
2 Correct 49 ms 63224 KB Output is correct
3 Correct 32 ms 63224 KB Output is correct
4 Correct 33 ms 63228 KB Output is correct
5 Correct 30 ms 63224 KB Output is correct
6 Correct 33 ms 63252 KB Output is correct
7 Correct 35 ms 63232 KB Output is correct
8 Correct 30 ms 63320 KB Output is correct
9 Correct 35 ms 63224 KB Output is correct
10 Correct 31 ms 63228 KB Output is correct
11 Correct 37 ms 63224 KB Output is correct
12 Correct 30 ms 63232 KB Output is correct
13 Correct 35 ms 63224 KB Output is correct
14 Correct 30 ms 63232 KB Output is correct
15 Correct 35 ms 63224 KB Output is correct
16 Correct 29 ms 63224 KB Output is correct
17 Correct 36 ms 63228 KB Output is correct
18 Correct 31 ms 63360 KB Output is correct
19 Correct 33 ms 63360 KB Output is correct
20 Correct 31 ms 63360 KB Output is correct
21 Correct 32 ms 63232 KB Output is correct
22 Correct 30 ms 63232 KB Output is correct
23 Correct 30 ms 63224 KB Output is correct
24 Correct 35 ms 63360 KB Output is correct
25 Correct 31 ms 63360 KB Output is correct
26 Correct 30 ms 63360 KB Output is correct
27 Correct 30 ms 63232 KB Output is correct
28 Correct 34 ms 63288 KB Output is correct
29 Correct 34 ms 63272 KB Output is correct
30 Correct 30 ms 63360 KB Output is correct
31 Correct 33 ms 63360 KB Output is correct
32 Correct 31 ms 63352 KB Output is correct
33 Correct 31 ms 63360 KB Output is correct
34 Correct 31 ms 63352 KB Output is correct
35 Correct 33 ms 63256 KB Output is correct
36 Correct 34 ms 63304 KB Output is correct
37 Correct 30 ms 63352 KB Output is correct
38 Correct 29 ms 63224 KB Output is correct
39 Correct 35 ms 63360 KB Output is correct
40 Correct 33 ms 63224 KB Output is correct
41 Correct 37 ms 63224 KB Output is correct
42 Correct 32 ms 63268 KB Output is correct
43 Correct 80 ms 66552 KB Output is correct
44 Incorrect 320 ms 74104 KB X_i is not increasing
45 Halted 0 ms 0 KB -