Submission #209295

#	Time	Username	Problem	Language	Result	Execution time	Memory
209295		coldEr66	Naan (JOI19_naan)	C++14	100 / 100	1434 ms	103544 KiB

naan

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
typedef pair<ii,int> iii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define eb emplace_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%d (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }

const ll MAXn=2e3+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

struct fraction{
    ll a,b;
    fraction() {
        a = 0, b = 1;
    }
    fraction(ll _a,ll _b) {
        ll gcd = __gcd(_a,_b);
        a = _a/gcd, b = _b/gcd;
    }
    bool operator <= (const fraction &y) {
        __int128 xx = (__int128)a * y.b, yy = (__int128)b * y.a;
        return xx <= yy;
    }
    bool operator < (const fraction &y) {
        __int128 xx = (__int128)a * y.b, yy = (__int128)b * y.a;
        return xx < yy;
    }
    fraction operator - (const fraction &y) {
        if (b != y.b) {
            __int128 xx = (__int128)a*y.b, yy = (__int128)b*y.a, zz = (__int128)b*y.b;
            __int128 gcd = __gcd(b,y.b);
            xx /= gcd, yy /= gcd, zz /= gcd;
            fraction ret = fraction(ll(xx - yy),(ll)zz);
            return ret;
        }
        else {
            __int128 xx = __int128(a - y.a), yy = __int128(b);
            __int128 gcd = __gcd(xx,yy);
            xx /= gcd, yy /= gcd;
            fraction ret = fraction((ll)xx,(ll)yy);
            return ret;
        }
    }
    fraction operator + (const fraction &y){
        if (b != y.b) {
            __int128 xx = (__int128)a*y.b, yy = (__int128)b*y.a, zz = (__int128)b*y.b;
            __int128 gcd = __gcd(b,y.b);
            xx /= gcd, yy /= gcd, zz /= gcd;
            fraction ret = fraction(ll(xx + yy),ll(zz));
            return ret;
        }
        else {
            __int128 xx = __int128(a + y.a), yy = __int128(b);
            __int128 gcd = __gcd(xx,yy);
            xx /= gcd, yy /= gcd;
            fraction ret = fraction((ll)xx,(ll)yy);
            return ret;
        }
    }
};
fraction cut[MAXn][MAXn];
ll n,l;
ll v[MAXn][MAXn];
ll ansp[MAXn];
bool ok[MAXn];
ll d[MAXn];
void build(ll x,ll sum) {
    REP (i,l) d[i] = n*v[x][i];
    int idx = 0;
    REP (i,n-1) {
        ll tmp = sum;
        while (1) {
            if (d[idx] < tmp) tmp -= d[idx++];
            else {
                d[idx] -= tmp;
                cut[x][i] = fraction(idx+1,1) - fraction(d[idx],n*v[x][idx]);
                break;
            }
        }
    }
}
int main(){
    IOS();
    cin >> n >> l;
    REP (i,n) {
        ll tmp = 0;
        REP (j,l) {
            cin >> v[i][j];
            tmp += v[i][j];
        }
        build(i,tmp);
    }

    REP (j,n-1) {
        int bst = -1;
        REP (i,n) {
            if (ok[i]) continue;
            if (bst == -1 || cut[i][j] < cut[bst][j]) bst = i;
        }
        ok[bst] = true;
        cout << cut[bst][j].a << ' ' << cut[bst][j].b << endl;
        ansp[j] = bst;
    }
    REP (i,n) if (!ok[i]) ansp[n-1] = i;
    REP (i,n) cout << ansp[i] + 1 << " \n"[i==n-1];
}

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