oj.uz

Submission #936073

# Submission time Handle Problem Language Result Execution time Memory
936073 2024-03-01T05:53:56 Z guagua0407 Naan (JOI19_naan) C++17
100 / 100
 448 ms 107264 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pll pair<ll,int>

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

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;
}

bool les(pll a,pll  b){
    return (__int128)a.f*b.s<(__int128)a.s*b.f;
}

void sir(pll &x){
    ll g=__gcd(x.f,1ll*x.s);
    x.f/=g;
    x.s/=g;
}

signed main() {_
    int n,l;
    n=readint();
    l=readint();
    vector<vector<int>> v0(n,vector<int>(l));
    vector<vector<int>> v(n,vector<int>(l));
    vector<int> sum(n);
    for(int i=0;i<n;i++){
        for(int j=0;j<l;j++){
            v0[i][j]=readint();
            sum[i]+=v0[i][j];
            v[i][j]=v0[i][j]*n;
        }
    }
    vector<vector<pll>> cut(n,vector<pll>(n));
    for(int i=0;i<n;i++){
        int pos=0;
        int rem=v[i][0];
        for(int j=0;j<n-1;j++){
            int now=sum[i];
            while(pos<l and rem<=now){
                now-=rem;
                pos++;
                rem=v[i][pos];
            }
            rem-=now;
            cut[i][j]={1ll*v[i][pos]*(pos+1)-rem,v[i][pos]};
            sir(cut[i][j]);
            //cout<<cut[i][j].f<<'/'<<cut[i][j].s<<' ';
        }
        //cout<<'\n';
    }
    vector<bool> used(n);
    vector<int> ans;
    for(int i=0;i<n;i++){
        int mn=-1;
        for(int j=0;j<n;j++){
            if(used[j]) continue;
            if(mn==-1) mn=j;
            else if(les(cut[j][i],cut[mn][i])){
                mn=j;
            }
        }
        ans.push_back(mn);
        used[mn]=true;
    }
    for(int i=0;i<n-1;i++){
        cout<<cut[ans[i]][i].f<<' '<<cut[ans[i]][i].s<<'\n';
    }
    for(int i=0;i<n;i++){
        cout<<ans[i]+1<<' ';
    }
    return 0;
}
//maybe its multiset not set
//yeeorz
//laborz

Compilation message

naan.cpp: In function 'void setIO(std::string)':
naan.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
naan.cpp:17:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 0 ms 472 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 484 KB Output is correct
18 Correct 0 ms 856 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 492 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 600 KB Output is correct
28 Correct 0 ms 472 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 356 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 484 KB Output is correct
33 Correct 0 ms 856 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 492 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 38 ms 9552 KB Output is correct
44 Correct 223 ms 49644 KB Output is correct
45 Correct 66 ms 23384 KB Output is correct
46 Correct 6 ms 4192 KB Output is correct
47 Correct 124 ms 32304 KB Output is correct
48 Correct 381 ms 64608 KB Output is correct
49 Correct 78 ms 18008 KB Output is correct
50 Correct 436 ms 85768 KB Output is correct
51 Correct 133 ms 34168 KB Output is correct
52 Correct 340 ms 77156 KB Output is correct
53 Correct 320 ms 67008 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 190 ms 33280 KB Output is correct
56 Correct 188 ms 47720 KB Output is correct
57 Correct 156 ms 39796 KB Output is correct
58 Correct 296 ms 64900 KB Output is correct
59 Correct 144 ms 40392 KB Output is correct
60 Correct 351 ms 106920 KB Output is correct
61 Correct 354 ms 106980 KB Output is correct
62 Correct 419 ms 106528 KB Output is correct
63 Correct 386 ms 107060 KB Output is correct
64 Correct 364 ms 107264 KB Output is correct
65 Correct 440 ms 95568 KB Output is correct
66 Correct 448 ms 95828 KB Output is correct
67 Correct 383 ms 95616 KB Output is correct
68 Correct 142 ms 44372 KB Output is correct
69 Correct 123 ms 42320 KB Output is correct
70 Correct 183 ms 54356 KB Output is correct
71 Correct 207 ms 65108 KB Output is correct