oj.uz

답안 #377197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377197 2021-03-13T08:59:24 Z balbit Naan (JOI19_naan) C++14
100 / 100
 809 ms 103304 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int N = 2e3+5;

struct frac{
    ll a,b;
    frac(){}
    frac (ll c, ll d): a(c), b(d){
        ll g = __gcd(a,b);
        a/=g; b/=g;
    }
    bool operator < (frac &oth) {
        return a* (__int128)oth.b < b * (__int128)oth.a;
    }
    bool operator == (frac &oth) {
        return a*oth.b == b * oth.a;
    }
};

ll V[N][N], P[N], SM[N];
bool done[N];
frac X[N][N];

signed main(){
    IOS();
    ll n, k; cin>>n>>k;
    // k segments in naan
    REP(i,n) {
        REP(j,k) {
            cin>>V[i][j];
            SM[i] += V[i][j];
        }
        ll need = SM[i], it = 0, step = 0;
        REP(j,k) {
            ll hi = V[i][j] * n;
            while (hi >= need) {
                step += need; hi -= need; need = SM[i];
                X[i][it++] = frac{j*V[i][j]*n + step, V[i][j] * n};
            }
            step = 0;
            need -= hi;
        }
        assert(it == n);
    }
    REP(i,n) {
        int who = -1;
        REP(j,n) {
            if(!done[j] && (who == -1 || X[j][i] < X[who][i])) {
                who = j;
            }
        }
        done[who] = 1; P[i] = who;
        if (i != n-1)
            cout<<X[who][i].a<<' '<<X[who][i].b<<endl;
    }
    REP(i,n) {
        cout<<P[i]+1<<' ';
    }

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 2 ms 492 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 66 ms 11904 KB Output is correct
44 Correct 403 ms 53996 KB Output is correct
45 Correct 186 ms 28884 KB Output is correct
46 Correct 21 ms 4076 KB Output is correct
47 Correct 260 ms 42476 KB Output is correct
48 Correct 536 ms 75372 KB Output is correct
49 Correct 128 ms 24212 KB Output is correct
50 Correct 685 ms 95852 KB Output is correct
51 Correct 273 ms 41580 KB Output is correct
52 Correct 610 ms 87296 KB Output is correct
53 Correct 531 ms 80876 KB Output is correct
54 Correct 1 ms 492 KB Output is correct
55 Correct 251 ms 44012 KB Output is correct
56 Correct 350 ms 56428 KB Output is correct
57 Correct 287 ms 49388 KB Output is correct
58 Correct 485 ms 78848 KB Output is correct
59 Correct 297 ms 46060 KB Output is correct
60 Correct 720 ms 98284 KB Output is correct
61 Correct 733 ms 98356 KB Output is correct
62 Correct 809 ms 98028 KB Output is correct
63 Correct 758 ms 98284 KB Output is correct
64 Correct 735 ms 98412 KB Output is correct
65 Correct 783 ms 103148 KB Output is correct
66 Correct 778 ms 103304 KB Output is correct
67 Correct 698 ms 103148 KB Output is correct
68 Correct 297 ms 60364 KB Output is correct
69 Correct 300 ms 56644 KB Output is correct
70 Correct 359 ms 72300 KB Output is correct
71 Correct 473 ms 82432 KB Output is correct