oj.uz

Submission #777062

# Submission time Handle Problem Language Result Execution time Memory
777062 2023-07-08T15:02:39 Z bachhoangxuan Naan (JOI19_naan) C++17
100 / 100
 584 ms 85204 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
struct frac{
    int a=0,b=1;
    frac(int _a=0,int _b=1):a(_a),b(_b){
        int g=__gcd(a,b);
        a/=g;b/=g;
    }
    friend bool operator<(frac x,frac y){
        return (__int128)x.a*y.b<(__int128)x.b*y.a;
    }
    friend bool operator>(frac x,frac y){
        return (__int128)x.a*y.b>(__int128)x.b*y.a;
    }
};
void solve(){
    int n,l;cin >> n >> l;
    vector<vector<frac>> f(n+1,vector<frac>(n+1));
    vector<bool> check(n+1,false);
    for(int i=1;i<=n;i++){
        int sum=0;vector<int> v(l+1,0);
        for(int j=1;j<=l;j++) cin >> v[j],sum+=v[j],v[j]*=n;
        int cur=0,ss=0;
        for(int j=1;j<=n;j++){
            ss+=sum;
            while(v[cur]<ss) ss-=v[cur++];
            f[i][j]=frac((cur-1)*v[cur]+ss,v[cur]);
        }
    }
    vector<pair<frac,int>> ans;
    for(int i=1;i<=n;i++){
        pair<frac,int> Min={frac(inf,1),0};
        for(int j=1;j<=n;j++){
            if(check[j]) continue;
            Min=min(Min,mpp(f[j][i],j));
        }
        ans.push_back(Min);check[Min.se]=1;
    }
    for(int i=0;i<n-1;i++) cout << ans[i].fi.a << ' ' << ans[i].fi.b << '\n';
    for(int i=0;i<n;i++) cout << ans[i].se << ' ';
    cout << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 280 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 280 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 47 ms 5324 KB Output is correct
44 Correct 292 ms 29632 KB Output is correct
45 Correct 123 ms 15240 KB Output is correct
46 Correct 13 ms 1620 KB Output is correct
47 Correct 184 ms 23572 KB Output is correct
48 Correct 407 ms 57420 KB Output is correct
49 Correct 93 ms 13184 KB Output is correct
50 Correct 503 ms 66920 KB Output is correct
51 Correct 177 ms 21104 KB Output is correct
52 Correct 429 ms 53456 KB Output is correct
53 Correct 388 ms 49828 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 191 ms 31676 KB Output is correct
56 Correct 242 ms 30984 KB Output is correct
57 Correct 199 ms 26488 KB Output is correct
58 Correct 348 ms 49708 KB Output is correct
59 Correct 203 ms 24140 KB Output is correct
60 Correct 496 ms 84996 KB Output is correct
61 Correct 508 ms 84940 KB Output is correct
62 Correct 584 ms 84996 KB Output is correct
63 Correct 546 ms 85204 KB Output is correct
64 Correct 523 ms 85100 KB Output is correct
65 Correct 563 ms 71832 KB Output is correct
66 Correct 553 ms 71812 KB Output is correct
67 Correct 495 ms 71756 KB Output is correct
68 Correct 196 ms 36328 KB Output is correct
69 Correct 195 ms 32244 KB Output is correct
70 Correct 242 ms 45612 KB Output is correct
71 Correct 310 ms 51100 KB Output is correct