oj.uz

Submission #524402

# Submission time Handle Problem Language Result Execution time Memory
524402 2022-02-09T07:14:46 Z alirezasamimi100 Naan (JOI19_naan) C++17
29 / 100
 25 ms 11020 KB 
/*#pragma GCC optimize("Ofast,unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")*/
/*#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")*/
#include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
using point=complex<double>;
#define F first
#define S second
//#define X real()
//#define Y imag()
#define pb push_back
#define mp make_pair
#define lc v<<1
#define rc v<<1|1
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define kill(x) cout << x << '\n';exit(0)
#define killshayan kill("done!")
#define killmashtali kill("Hello, World!")
const int N=2e3+10,LN=19,M=1e5+10,SQ=450,BS=737,inf=1e9,NSQ=N/SQ+1;
const ll INF=1e18;
const double pi=acos(-1);
const ld ep=1e-7;
const int MH=1000696969,MD=998244353,MOD=1000000007;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pii, null_type,greater<pii>, rb_tree_tag,tree_order_statistics_node_update>
ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}
pll b[N][N];
ll n,m,a[N][N],p[N],q[N],s[N];
int main(){
    fast_io;
    cin >> n >> m;
    for(ll i=1; i<=n; i++){
        for(ll j=1; j<=m; j++){
            cin >> a[i][j];
            s[i]+=a[i][j];
        }
    }
    for(ll i=1; i<=n; i++){
        ll p=1,x=0;
        for(ll j=1; j<=m; j++){
            while(x+a[i][p]*n<j*s[i]) x+=a[i][p++]*n;
            b[i][j]={(p-1)*a[i][p]*n+j*s[i]-x,a[i][p]*n};
        }
    }
    for(ll j=1; j<=n; j++){
        pll mn={m+1,1};
        ll t;
        for(ll i=1; i<=n; i++){
            if(p[i]) continue;
            if((ld)b[i][j].F/b[i][j].S<(ld)mn.F/mn.S) mn=b[i][j],t=i;
        }
        if(j<n) cout << mn.F << ' ' << mn.S << '\n';
        p[t]=j;
        q[j]=t;
    }
    for(ll i=1; i<=n; i++) cout << q[i] << ' ';
    cout << '\n';
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:72:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         q[j]=t;
      |         ~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 9 ms 376 KB Output is correct
3 Correct 10 ms 460 KB Output is correct
4 Correct 10 ms 424 KB Output is correct
5 Correct 11 ms 444 KB Output is correct
6 Correct 9 ms 332 KB Output is correct
7 Correct 12 ms 396 KB Output is correct
8 Correct 9 ms 460 KB Output is correct
9 Correct 10 ms 332 KB Output is correct
10 Correct 10 ms 436 KB Output is correct
11 Correct 9 ms 460 KB Output is correct
12 Correct 9 ms 460 KB Output is correct
13 Correct 9 ms 412 KB Output is correct
14 Correct 9 ms 460 KB Output is correct
15 Correct 10 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 14 ms 496 KB Output is correct
3 Correct 20 ms 588 KB Output is correct
4 Correct 19 ms 588 KB Output is correct
5 Correct 20 ms 588 KB Output is correct
6 Correct 14 ms 460 KB Output is correct
7 Correct 10 ms 460 KB Output is correct
8 Correct 20 ms 460 KB Output is correct
9 Correct 20 ms 576 KB Output is correct
10 Correct 20 ms 588 KB Output is correct
11 Correct 19 ms 596 KB Output is correct
12 Correct 14 ms 388 KB Output is correct
13 Correct 14 ms 476 KB Output is correct
14 Correct 20 ms 588 KB Output is correct
15 Correct 20 ms 592 KB Output is correct
16 Correct 20 ms 588 KB Output is correct
17 Correct 20 ms 588 KB Output is correct
18 Correct 22 ms 588 KB Output is correct
19 Correct 21 ms 648 KB Output is correct
20 Correct 17 ms 564 KB Output is correct
21 Correct 20 ms 652 KB Output is correct
22 Correct 21 ms 716 KB Output is correct
23 Correct 7 ms 460 KB Output is correct
24 Correct 20 ms 556 KB Output is correct
25 Correct 15 ms 520 KB Output is correct
26 Correct 9 ms 460 KB Output is correct
27 Correct 18 ms 588 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 9 ms 376 KB Output is correct
3 Correct 10 ms 460 KB Output is correct
4 Correct 10 ms 424 KB Output is correct
5 Correct 11 ms 444 KB Output is correct
6 Correct 9 ms 332 KB Output is correct
7 Correct 12 ms 396 KB Output is correct
8 Correct 9 ms 460 KB Output is correct
9 Correct 10 ms 332 KB Output is correct
10 Correct 10 ms 436 KB Output is correct
11 Correct 9 ms 460 KB Output is correct
12 Correct 9 ms 460 KB Output is correct
13 Correct 9 ms 412 KB Output is correct
14 Correct 9 ms 460 KB Output is correct
15 Correct 10 ms 376 KB Output is correct
16 Correct 10 ms 460 KB Output is correct
17 Correct 14 ms 496 KB Output is correct
18 Correct 20 ms 588 KB Output is correct
19 Correct 19 ms 588 KB Output is correct
20 Correct 20 ms 588 KB Output is correct
21 Correct 14 ms 460 KB Output is correct
22 Correct 10 ms 460 KB Output is correct
23 Correct 20 ms 460 KB Output is correct
24 Correct 20 ms 576 KB Output is correct
25 Correct 20 ms 588 KB Output is correct
26 Correct 19 ms 596 KB Output is correct
27 Correct 14 ms 388 KB Output is correct
28 Correct 14 ms 476 KB Output is correct
29 Correct 20 ms 588 KB Output is correct
30 Correct 20 ms 592 KB Output is correct
31 Correct 20 ms 588 KB Output is correct
32 Correct 20 ms 588 KB Output is correct
33 Correct 22 ms 588 KB Output is correct
34 Correct 21 ms 648 KB Output is correct
35 Correct 17 ms 564 KB Output is correct
36 Correct 20 ms 652 KB Output is correct
37 Correct 21 ms 716 KB Output is correct
38 Correct 7 ms 460 KB Output is correct
39 Correct 20 ms 556 KB Output is correct
40 Correct 15 ms 520 KB Output is correct
41 Correct 9 ms 460 KB Output is correct
42 Correct 18 ms 588 KB Output is correct
43 Incorrect 25 ms 11020 KB X_i is not increasing
44 Halted 0 ms 0 KB -