oj.uz

Submission #524414

# Submission time Handle Problem Language Result Execution time Memory
524414 2022-02-09T07:25:24 Z Koosha_mv Naan (JOI19_naan) C++14
100 / 100
 622 ms 128740 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll

const int N=2020;

int n,m,a[N][N],sum[N],mark[N];
vector<int> p;
vector<pair<int,int> > ans;
vector<pair<int,pair<int,int> > > v[N];

bool cmp(pair<int,pair<int,int> > i,pair<int,pair<int,int> > j){
	pair<__int128,__int128> u=i.S,v=j.S;
	return u.F*v.S<u.S*v.F;
}
void solve(int x){
	int p=1;
	f(i,1,n+1){
		while(a[x][p]<i*sum[x]){
			p++;
		}
		//cout<<p<<" "<<a[x][p]<<" "<<sum[i]<<endl;
		pair<int,int> e;
		e.S=a[x][p]-a[x][p-1];
		e.F=e.S*(p-1)+(i*sum[x])-a[x][p-1];		
		v[i].pb(mp(x,e));
		//cout<<x<<" "<<i<<" -> "<<e.F<<" "<<e.S<<endl;
	}	
}

main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	cin>>n>>m;
	f(i,1,n+1){
		f(j,1,m+1){
			cin>>a[i][j];
			sum[i]+=a[i][j];
			a[i][j]*=n;
			a[i][j]+=a[i][j-1];		
		}
	}
	f(i,1,n+1){
		solve(i);
	}
	f(i,1,n+1){
		sort(all(v[i]),cmp);
		for(auto x : v[i]){
			if(!mark[x.F]){
				mark[x.F]=1;
				p.pb(x.F);
				ans.pb(x.S);
				break;
			}
		}
	}
	f(i,0,ans.size()-1){
		cout<<ans[i].F<<" "<<ans[i].S<<'\n';
	}
	f(i,0,p.size()) cout<<p[i]<<" ";
}

Compilation message

naan.cpp:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main(){
      | ^~~~
naan.cpp: In function 'int main()':
naan.cpp:8:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   75 |  f(i,0,ans.size()-1){
      |    ~~~~~~~~~~~~~~~~            
naan.cpp:75:2: note: in expansion of macro 'f'
   75 |  f(i,0,ans.size()-1){
      |  ^
naan.cpp:8:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   78 |  f(i,0,p.size()) cout<<p[i]<<" ";
      |    ~~~~~~~~~~~~                
naan.cpp:78:2: note: in expansion of macro 'f'
   78 |  f(i,0,p.size()) cout<<p[i]<<" ";
      |  ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 58 ms 16468 KB Output is correct
44 Correct 350 ms 77096 KB Output is correct
45 Correct 143 ms 26968 KB Output is correct
46 Correct 15 ms 2692 KB Output is correct
47 Correct 223 ms 39368 KB Output is correct
48 Correct 487 ms 105292 KB Output is correct
49 Correct 114 ms 28868 KB Output is correct
50 Correct 622 ms 123660 KB Output is correct
51 Correct 222 ms 57296 KB Output is correct
52 Correct 521 ms 107076 KB Output is correct
53 Correct 463 ms 102340 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 255 ms 67272 KB Output is correct
56 Correct 301 ms 74660 KB Output is correct
57 Correct 268 ms 67328 KB Output is correct
58 Correct 453 ms 101316 KB Output is correct
59 Correct 241 ms 62096 KB Output is correct
60 Correct 521 ms 128740 KB Output is correct
61 Correct 511 ms 128480 KB Output is correct
62 Correct 594 ms 128188 KB Output is correct
63 Correct 580 ms 128436 KB Output is correct
64 Correct 528 ms 128612 KB Output is correct
65 Correct 442 ms 128452 KB Output is correct
66 Correct 447 ms 128448 KB Output is correct
67 Correct 441 ms 128508 KB Output is correct
68 Correct 224 ms 77468 KB Output is correct
69 Correct 222 ms 70852 KB Output is correct
70 Correct 258 ms 91024 KB Output is correct
71 Correct 343 ms 96932 KB Output is correct