Submission #707039

#	Time	Username	Problem	Language	Result	Execution time	Memory
707039		Antekb	Naan (JOI19_naan)	C++14	100 / 100	654 ms	150268 KiB

naan

#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int K=20, N=1<<K, INF=1e9+5, mod2=1e9+7, mod=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}
vector<pair<pair<ll, ll>, int> > part[N];
int main(){
	//factinit();
	BOOST;
	int n, l;
	cin>>n>>l;
	for(int i=0; i<n; i++){
		ll sum=0;
		vi V(l);
		for(int j=0; j<l; j++){
			cin>>V[j];
			sum+=V[j];
			V[j]*=n;
		}
		int wsk=1;
		ll sum2=0;
		//deb(sum);
		for(int j=0; j<l; j++){
			int z=0;
			while(sum2+V[j]>=wsk*sum){
				int zz=wsk*sum-sum2;
				//deb(zz);
				part[wsk].pb(mp(mp(j*1ll*V[j]+zz, V[j]), i));
				//deb(part[wsk].back());
				z=zz;
				wsk++;
			}
			sum2+=V[j];
		}
	}
	vi uzy(n);
	vi ans;
	for(int i=1; i<=n; i++){
		//deb(part[i]);
		sort(part[i].begin(), part[i].end(), [](pair<pair<ll, ll>, int> a, pair<pair<ll, ll>, int> b){
			if(__int128(a.st.st)*b.st.nd==__int128(a.st.nd)*b.st.st)return a.nd<b.nd;
			return __int128(a.st.st)*b.st.nd<__int128(a.st.nd)*b.st.st;
		});
		for(int j=0; j<n; j++){
			if(!uzy[part[i][j].nd]){
				ans.pb(part[i][j].nd);
				uzy[part[i][j].nd]=1;
				if(i!=n)cout<<part[i][j].st.st<<" "<<part[i][j].st.nd<<"\n";
				break;
			}
		}
	}
	for(int i:ans)cout<<i+1<<" ";
}

Compilation message (stderr)

naan.cpp: In function 'int main()':
naan.cpp:136:8: warning: variable 'z' set but not used [-Wunused-but-set-variable]
  136 |    int z=0;
      |        ^

• Subtask 1: 5 / 5
• Subtask 2: 24 / 24
• Subtask 3: 71 / 71