oj.uz

Submission #377193

# Submission time Handle Problem Language Result Execution time Memory
377193 2021-03-13T08:51:30 Z balbit Naan (JOI19_naan) C++14
0 / 100
 2 ms 492 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*oth.b < b * 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[i][j] < X[i][who])) {
                who = j;
            }
        }
        done[who] = 1; P[i] = who;
        if (i != n-1)
            cout<<X[i][who].a<<' '<<X[i][who].b<<endl;
    }
    REP(i,n) {
        cout<<P[i]+1<<' ';
    }

}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Not a fair distribution.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory 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 2 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 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 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 2 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 2 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 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 Incorrect 1 ms 364 KB Not a fair distribution.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Not a fair distribution.
2 Halted 0 ms 0 KB -