oj.uz

답안 #384370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
384370 2021-04-01T13:20:16 Z i_am_noob Naan (JOI19_naan) C++17
100 / 100
 193 ms 117612 KB 
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,fma")
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;

#define ll long long
#define int ll
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
//#define inf 1010000000
#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#ifdef i_am_noob
#define bug(...) cerr << "#" << __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 bug(...) 826
#endif

inline char readchar(){
    const int maxn=1000000;
    static char buf[maxn],*p=buf,*q=buf;
    if(p==q&&(q=(p=buf)+fread(buf,1,maxn,stdin))==buf) return EOF;
    else return *p++;
}
inline int readint(){
    int c=readchar(),x=0,neg=0;
    while((c<'0'||c>'9')&&c!='-'&&c!=EOF) c=readchar();
    if(c=='-') neg=1,c=readchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^'0'),c=readchar();
    return neg?-x:x;
}

const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod;
const int maxn=2005;
//i_am_noob
int n,m,a[maxn][maxn],ans[maxn];
bool vis[maxn];

struct rational{
    int x,y;
    bool operator <(const rational& o) const {return x/y!=o.x/o.y?x/y<o.x/o.y:(x%y)*o.y<y*(o.x%o.y);}
};

rational val[maxn][maxn];

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    n=readint(),m=readint();
    rep(n) rep1(j,m) a[i][j]=readint();
    rep(n){
        int sum=0;
        rep1(j,m) sum+=a[i][j];
        int cur=0,curval=0;
        rep1(j,n-1){
            while((curval+a[i][cur])*n<=sum*(j+1)){
                curval+=a[i][cur];
                cur++;
            }
            val[i][j].x=cur*n*a[i][cur]+sum*(j+1)-curval*n;
            val[i][j].y=n*a[i][cur];
        }
    }
    rep(n-1){
        rational minn={inf,1};
        int minid;
        rep1(j,n) if(!vis[j]) if(val[j][i]<minn) minn=val[j][i],minid=j;
        vis[minid]=1;
        ans[i]=minid;
        cout << minn.x << ' ' << minn.y << "\n";
    }
    rep(n) if(!vis[i]) ans[n-1]=i;
    rep(n) cout << ans[i]+1 << " \n"[i==n-1];
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:86:15: warning: 'minid' may be used uninitialized in this function [-Wmaybe-uninitialized]
   86 |         ans[i]=minid;
      |         ~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 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 2 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 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 512 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 1 ms 492 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 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 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 1 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 2 ms 492 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 2 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 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 2 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 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 512 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 1 ms 492 KB Output is correct
31 Correct 2 ms 636 KB Output is correct
32 Correct 2 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 2 ms 492 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 1 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 18 ms 14444 KB Output is correct
44 Correct 97 ms 64876 KB Output is correct
45 Correct 52 ms 29804 KB Output is correct
46 Correct 8 ms 5100 KB Output is correct
47 Correct 66 ms 43520 KB Output is correct
48 Correct 81 ms 76268 KB Output is correct
49 Correct 25 ms 25068 KB Output is correct
50 Correct 112 ms 96632 KB Output is correct
51 Correct 54 ms 42864 KB Output is correct
52 Correct 109 ms 87936 KB Output is correct
53 Correct 91 ms 81900 KB Output is correct
54 Correct 1 ms 492 KB Output is correct
55 Correct 42 ms 44268 KB Output is correct
56 Correct 64 ms 57324 KB Output is correct
57 Correct 53 ms 50284 KB Output is correct
58 Correct 90 ms 79596 KB Output is correct
59 Correct 53 ms 47084 KB Output is correct
60 Correct 193 ms 117612 KB Output is correct
61 Correct 190 ms 117484 KB Output is correct
62 Correct 187 ms 117100 KB Output is correct
63 Correct 188 ms 117612 KB Output is correct
64 Correct 190 ms 117484 KB Output is correct
65 Correct 141 ms 104172 KB Output is correct
66 Correct 136 ms 104300 KB Output is correct
67 Correct 149 ms 104332 KB Output is correct
68 Correct 76 ms 61164 KB Output is correct
69 Correct 77 ms 57580 KB Output is correct
70 Correct 87 ms 73068 KB Output is correct
71 Correct 122 ms 83328 KB Output is correct