oj.uz

Submission #1028208

# Submission time Handle Problem Language Result Execution time Memory
1028208 2024-07-19T15:14:00 Z CSQ31 Growing Vegetables is Fun 5 (JOI24_vegetables5) C++17
30 / 100
 5000 ms 21212 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 1e6;
int a[MAXN],b[MAXN],c[MAXN];
int n;
int comp1(int x){
    vector<int>v,u;
    for(int i=0;i<2*n;i++){
        if(i>=x && i<x+n)v.pb(a[i]);
        else u.pb(a[i]);
    }
    sort(all(v));
    sort(all(u));
    int mx = 0;
    for(int i=0;i<n;i++)mx = max(mx,abs(v[i]-b[i]));
    for(int i=0;i<n;i++)mx = max(mx,abs(u[i]-c[i]));
    return mx;
}
int comp2(int x){
    vector<int>v,u;
    for(int i=0;i<2*n;i++){
        if(i>=x && i<x+n)v.pb(a[i]);
        else u.pb(a[i]);
    }
    sort(all(v));
    sort(all(u));
    int mx = 0;
    for(int i=0;i<n;i++)mx = max(mx,abs(u[i]-b[i]));
    for(int i=0;i<n;i++)mx = max(mx,abs(v[i]-c[i]));
    return mx;
}
int main()
{
    owo
    cin>>n;
    for(int i=0;i<2*n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    for(int i=0;i<n;i++)cin>>c[i];
    sort(b,b+n);
    sort(c,c+n);
    int ans = 1e9;
    for(int i=0;i<=n;i++){
        int res = comp1(i);
        ans = min(ans,res);
        //cout<<res<<'\n';
    }
    cout<<'\n';
    for(int i=0;i<=n;i++){
        int res = comp2(i);
        ans = min(ans,res);
        //cout<<res<<'\n';
    }
    cout<<ans<<'\n';
    

}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 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 0 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 348 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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 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 0 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 348 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 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 0 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 348 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 366 ms 616 KB Output is correct
27 Correct 360 ms 348 KB Output is correct
28 Correct 207 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 380 ms 624 KB Output is correct
31 Correct 331 ms 348 KB Output is correct
32 Correct 70 ms 348 KB Output is correct
33 Correct 16 ms 348 KB Output is correct
34 Correct 360 ms 604 KB Output is correct
35 Correct 361 ms 348 KB Output is correct
36 Correct 335 ms 604 KB Output is correct
37 Correct 133 ms 604 KB Output is correct
38 Correct 154 ms 604 KB Output is correct
39 Correct 188 ms 604 KB Output is correct
40 Correct 356 ms 348 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5037 ms 21212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 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 0 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 348 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 366 ms 616 KB Output is correct
27 Correct 360 ms 348 KB Output is correct
28 Correct 207 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 380 ms 624 KB Output is correct
31 Correct 331 ms 348 KB Output is correct
32 Correct 70 ms 348 KB Output is correct
33 Correct 16 ms 348 KB Output is correct
34 Correct 360 ms 604 KB Output is correct
35 Correct 361 ms 348 KB Output is correct
36 Correct 335 ms 604 KB Output is correct
37 Correct 133 ms 604 KB Output is correct
38 Correct 154 ms 604 KB Output is correct
39 Correct 188 ms 604 KB Output is correct
40 Correct 356 ms 348 KB Output is correct
41 Execution timed out 5037 ms 21212 KB Time limit exceeded
42 Halted 0 ms 0 KB -