oj.uz

Submission #942720

# Submission time Handle Problem Language Result Execution time Memory
942720 2024-03-11T03:31:50 Z yeediot Naan (JOI19_naan) C++14
100 / 100
 296 ms 148384 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=2005;
int v[mxn][mxn];
pii cut[mxn][mxn];
int pre[mxn][mxn];
bool cmp(pii a,pii b){
    return (__int128)a.F*b.S<(__int128)a.S*b.F;
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,l;
    cin>>n>>l;
    for(int i=0;i<n;i++){
        int sum=0;
        for(int j=1;j<=l;j++){
            cin>>v[i][j];
            sum+=v[i][j];
            v[i][j]*=n;
            pre[i][j]=pre[i][j-1]+v[i][j];
            //cerr<<v[i][j]<<' ';
        }
        int prev=0;
        int p=1;
        for(int j=0;j<n;j++){
            while(p+1<=l and pre[i][p]<=sum*(j+1))p++;
            cut[i][j]={((p-1)*v[i][p]+(sum*(j+1)-pre[i][p-1])),v[i][p]};
            debug(cut[i][j],p);
        }
    }
    vector<bool>used(n);
    vector<int>ans;
    for(int i=0;i<n;i++){
        int mn=-8e18;
        for(int j=0;j<n;j++){
            if(used[j])continue;
            if(mn==-8e18){
                mn=j;
            }
            else if(cmp(cut[j][i],cut[mn][i])){
                mn=j;
            }
        }
        ans.pb(mn+1);
        used[mn]=1;
    }
    for(int i=0;i+1<n;i++){
        cout<<cut[ans[i]-1][i].F<<' '<<cut[ans[i]-1][i].S<<'\n';
    }
    for(auto i:ans){
        cout<<i<<' ';
    }
    cout<<'\n';
}
 /*
 input:
 
 */

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:76:13: warning: unused variable 'prev' [-Wunused-variable]
   76 |         int prev=0;
      |             ^~~~
naan.cpp: In function 'void setIO(std::string)':
naan.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
naan.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4568 KB Output is correct
2 Correct 1 ms 4576 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4576 KB Output is correct
5 Correct 1 ms 4584 KB Output is correct
6 Correct 1 ms 4448 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4600 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4648 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4596 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4708 KB Output is correct
20 Correct 2 ms 4712 KB Output is correct
21 Correct 1 ms 4456 KB Output is correct
22 Correct 1 ms 4456 KB Output is correct
23 Correct 1 ms 4456 KB Output is correct
24 Correct 1 ms 4456 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4572 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4564 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4576 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4568 KB Output is correct
17 Correct 1 ms 4576 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4576 KB Output is correct
20 Correct 1 ms 4584 KB Output is correct
21 Correct 1 ms 4448 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 2 ms 4600 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4648 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 1 ms 4596 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4708 KB Output is correct
35 Correct 2 ms 4712 KB Output is correct
36 Correct 1 ms 4456 KB Output is correct
37 Correct 1 ms 4456 KB Output is correct
38 Correct 1 ms 4456 KB Output is correct
39 Correct 1 ms 4456 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4572 KB Output is correct
43 Correct 27 ms 39780 KB Output is correct
44 Correct 136 ms 101700 KB Output is correct
45 Correct 84 ms 57080 KB Output is correct
46 Correct 13 ms 14080 KB Output is correct
47 Correct 99 ms 76340 KB Output is correct
48 Correct 69 ms 112976 KB Output is correct
49 Correct 31 ms 55888 KB Output is correct
50 Correct 152 ms 130388 KB Output is correct
51 Correct 85 ms 73984 KB Output is correct
52 Correct 156 ms 122448 KB Output is correct
53 Correct 127 ms 115796 KB Output is correct
54 Correct 1 ms 4444 KB Output is correct
55 Correct 26 ms 77392 KB Output is correct
56 Correct 101 ms 90660 KB Output is correct
57 Correct 80 ms 84052 KB Output is correct
58 Correct 106 ms 113284 KB Output is correct
59 Correct 95 ms 80720 KB Output is correct
60 Correct 267 ms 148188 KB Output is correct
61 Correct 268 ms 148316 KB Output is correct
62 Correct 267 ms 148112 KB Output is correct
63 Correct 279 ms 148372 KB Output is correct
64 Correct 296 ms 148384 KB Output is correct
65 Correct 198 ms 134736 KB Output is correct
66 Correct 205 ms 134992 KB Output is correct
67 Correct 193 ms 134884 KB Output is correct
68 Correct 112 ms 96084 KB Output is correct
69 Correct 126 ms 92508 KB Output is correct
70 Correct 121 ms 107272 KB Output is correct
71 Correct 174 ms 118328 KB Output is correct