oj.uz

Submission #209295

# Submission time Handle Problem Language Result Execution time Memory
209295 2020-03-13T15:11:12 Z coldEr66 Naan (JOI19_naan) C++14
100 / 100
 1434 ms 103544 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 63224 KB Output is correct
2 Correct 37 ms 63356 KB Output is correct
3 Correct 37 ms 63352 KB Output is correct
4 Correct 38 ms 63352 KB Output is correct
5 Correct 38 ms 63352 KB Output is correct
6 Correct 39 ms 63352 KB Output is correct
7 Correct 37 ms 63352 KB Output is correct
8 Correct 38 ms 63352 KB Output is correct
9 Correct 37 ms 63228 KB Output is correct
10 Correct 38 ms 63352 KB Output is correct
11 Correct 38 ms 63352 KB Output is correct
12 Correct 39 ms 63352 KB Output is correct
13 Correct 67 ms 63352 KB Output is correct
14 Correct 36 ms 63352 KB Output is correct
15 Correct 37 ms 63352 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 63352 KB Output is correct
2 Correct 37 ms 63352 KB Output is correct
3 Correct 38 ms 63352 KB Output is correct
4 Correct 42 ms 63352 KB Output is correct
5 Correct 36 ms 63352 KB Output is correct
6 Correct 37 ms 63352 KB Output is correct
7 Correct 37 ms 63352 KB Output is correct
8 Correct 37 ms 63352 KB Output is correct
9 Correct 38 ms 63352 KB Output is correct
10 Correct 38 ms 63480 KB Output is correct
11 Correct 37 ms 63352 KB Output is correct
12 Correct 36 ms 63224 KB Output is correct
13 Correct 38 ms 63352 KB Output is correct
14 Correct 37 ms 63352 KB Output is correct
15 Correct 38 ms 63352 KB Output is correct
16 Correct 38 ms 63352 KB Output is correct
17 Correct 39 ms 63352 KB Output is correct
18 Correct 38 ms 63480 KB Output is correct
19 Correct 38 ms 63352 KB Output is correct
20 Correct 37 ms 63352 KB Output is correct
21 Correct 38 ms 63352 KB Output is correct
22 Correct 37 ms 63352 KB Output is correct
23 Correct 38 ms 63352 KB Output is correct
24 Correct 41 ms 63480 KB Output is correct
25 Correct 37 ms 63352 KB Output is correct
26 Correct 38 ms 63352 KB Output is correct
27 Correct 37 ms 63352 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 63224 KB Output is correct
2 Correct 37 ms 63356 KB Output is correct
3 Correct 37 ms 63352 KB Output is correct
4 Correct 38 ms 63352 KB Output is correct
5 Correct 38 ms 63352 KB Output is correct
6 Correct 39 ms 63352 KB Output is correct
7 Correct 37 ms 63352 KB Output is correct
8 Correct 38 ms 63352 KB Output is correct
9 Correct 37 ms 63228 KB Output is correct
10 Correct 38 ms 63352 KB Output is correct
11 Correct 38 ms 63352 KB Output is correct
12 Correct 39 ms 63352 KB Output is correct
13 Correct 67 ms 63352 KB Output is correct
14 Correct 36 ms 63352 KB Output is correct
15 Correct 37 ms 63352 KB Output is correct
16 Correct 39 ms 63352 KB Output is correct
17 Correct 37 ms 63352 KB Output is correct
18 Correct 38 ms 63352 KB Output is correct
19 Correct 42 ms 63352 KB Output is correct
20 Correct 36 ms 63352 KB Output is correct
21 Correct 37 ms 63352 KB Output is correct
22 Correct 37 ms 63352 KB Output is correct
23 Correct 37 ms 63352 KB Output is correct
24 Correct 38 ms 63352 KB Output is correct
25 Correct 38 ms 63480 KB Output is correct
26 Correct 37 ms 63352 KB Output is correct
27 Correct 36 ms 63224 KB Output is correct
28 Correct 38 ms 63352 KB Output is correct
29 Correct 37 ms 63352 KB Output is correct
30 Correct 38 ms 63352 KB Output is correct
31 Correct 38 ms 63352 KB Output is correct
32 Correct 39 ms 63352 KB Output is correct
33 Correct 38 ms 63480 KB Output is correct
34 Correct 38 ms 63352 KB Output is correct
35 Correct 37 ms 63352 KB Output is correct
36 Correct 38 ms 63352 KB Output is correct
37 Correct 37 ms 63352 KB Output is correct
38 Correct 38 ms 63352 KB Output is correct
39 Correct 41 ms 63480 KB Output is correct
40 Correct 37 ms 63352 KB Output is correct
41 Correct 38 ms 63352 KB Output is correct
42 Correct 37 ms 63352 KB Output is correct
43 Correct 159 ms 67576 KB Output is correct
44 Correct 755 ms 92152 KB Output is correct
45 Correct 307 ms 81524 KB Output is correct
46 Correct 64 ms 66296 KB Output is correct
47 Correct 476 ms 86392 KB Output is correct
48 Correct 1125 ms 79608 KB Output is correct
49 Correct 268 ms 71800 KB Output is correct
50 Correct 1335 ms 96632 KB Output is correct
51 Correct 466 ms 83428 KB Output is correct
52 Correct 1071 ms 97400 KB Output is correct
53 Correct 1006 ms 93072 KB Output is correct
54 Correct 38 ms 63480 KB Output is correct
55 Correct 562 ms 70520 KB Output is correct
56 Correct 631 ms 87928 KB Output is correct
57 Correct 503 ms 84856 KB Output is correct
58 Correct 913 ms 89592 KB Output is correct
59 Correct 502 ms 85112 KB Output is correct
60 Correct 1240 ms 95936 KB Output is correct
61 Correct 1251 ms 96264 KB Output is correct
62 Correct 1416 ms 96088 KB Output is correct
63 Correct 1319 ms 95932 KB Output is correct
64 Correct 1304 ms 96072 KB Output is correct
65 Correct 1434 ms 103492 KB Output is correct
66 Correct 1419 ms 103416 KB Output is correct
67 Correct 1207 ms 103544 KB Output is correct
68 Correct 528 ms 87672 KB Output is correct
69 Correct 481 ms 90616 KB Output is correct
70 Correct 637 ms 89976 KB Output is correct
71 Correct 762 ms 99452 KB Output is correct