oj.uz

Submission #915322

# Submission time Handle Problem Language Result Execution time Memory
915322 2024-01-23T16:53:18 Z bachhoangxuan Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 14488 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

const ld eps = 1e-10;

struct Rec{
    int x,y,u,v;
    Rec(int x=0,int y=0,int u=0,int v=0):x(x),y(y),u(u),v(v){}
    friend Rec operator+(Rec a,Rec b){
        return Rec(max(a.x,b.x),max(a.y,b.y),min(a.u,b.u),min(a.v,b.v));
    }
    int area(){
        if(x>u || y>v) return 0;
        else return (u-x+1)*(v-y+1);
    }
};

int n,k;
Rec p[maxn];

int rand_int(int l,int r){
    return l+(int)(rng()%(r-l+1));
}

void solve(){
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> p[i].x >> p[i].y >> p[i].u >> p[i].v;
    vector<Rec> res;
    auto cal = [&](){
        res.clear();
        set<int> s;
        for(int i=0;i<k;i++){
            int id=rand_int(1,n);
            while(s.find(id)!=s.end()) id=rand_int(1,n);
            s.insert(id);
            res.push_back(p[id]);
        }
        for(int i=1;i<=n;i++){
            if(s.find(i)!=s.end()) continue;
            ld d=0;
            int t=-1;
            for(int j=0;j<k;j++){
                ld cc=(ld)(res[j]+p[i]).area()/res[j].area();
                if(cc>d+eps) d=cc,t=j;
            }
            if(t==-1) return false;
            res[t]=res[t]+p[i];
        }
        return true;
    };
    while(!cal());
    for(auto c:res) cout << c.x << ' ' << c.y << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 4 ms 6732 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6744 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 3 ms 6744 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6744 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 5 ms 6748 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 6800 KB Output is correct
6 Correct 4 ms 6760 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 3 ms 6796 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 5 ms 6744 KB Output is correct
14 Correct 7 ms 6744 KB Output is correct
15 Correct 3 ms 6744 KB Output is correct
16 Correct 3 ms 6732 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 7 ms 6780 KB Output is correct
19 Correct 3 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 79 ms 6772 KB Output is correct
22 Correct 3 ms 6744 KB Output is correct
23 Correct 35 ms 6748 KB Output is correct
24 Correct 4 ms 6744 KB Output is correct
25 Correct 3 ms 6732 KB Output is correct
26 Correct 27 ms 6748 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 5 ms 6748 KB Output is correct
29 Correct 8 ms 6748 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 4 ms 6792 KB Output is correct
32 Correct 3 ms 6744 KB Output is correct
33 Correct 34 ms 6748 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 7 ms 6748 KB Output is correct
36 Correct 3 ms 6748 KB Output is correct
37 Correct 3 ms 6736 KB Output is correct
38 Correct 3 ms 6744 KB Output is correct
39 Correct 16 ms 6800 KB Output is correct
40 Correct 3 ms 6744 KB Output is correct
41 Correct 5 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 193 ms 6748 KB Output is correct
44 Correct 3 ms 6724 KB Output is correct
45 Correct 3 ms 6748 KB Output is correct
46 Correct 4 ms 6732 KB Output is correct
47 Correct 3 ms 6748 KB Output is correct
48 Correct 3 ms 6744 KB Output is correct
49 Correct 103 ms 6776 KB Output is correct
50 Correct 3 ms 6744 KB Output is correct
51 Correct 3 ms 6748 KB Output is correct
52 Correct 3 ms 6732 KB Output is correct
53 Correct 5 ms 6952 KB Output is correct
54 Correct 4 ms 7000 KB Output is correct
55 Correct 3 ms 6748 KB Output is correct
56 Correct 3 ms 6748 KB Output is correct
57 Correct 3 ms 6748 KB Output is correct
58 Correct 3 ms 6748 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 4 ms 6732 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6744 KB Output is correct
5 Correct 71 ms 14188 KB Output is correct
6 Correct 69 ms 14160 KB Output is correct
7 Correct 68 ms 14164 KB Output is correct
8 Correct 71 ms 14488 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 69 ms 14160 KB Output is correct
6 Correct 70 ms 14164 KB Output is correct
7 Correct 76 ms 14236 KB Output is correct
8 Correct 73 ms 14332 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 3 ms 6744 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6744 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 5 ms 6748 KB Output is correct
13 Correct 80 ms 14372 KB Output is correct
14 Correct 71 ms 14336 KB Output is correct
15 Correct 70 ms 14232 KB Output is correct
16 Correct 70 ms 14164 KB Output is correct
17 Correct 70 ms 14248 KB Output is correct
18 Correct 70 ms 14360 KB Output is correct
19 Correct 70 ms 14372 KB Output is correct
20 Correct 80 ms 14364 KB Output is correct
21 Correct 69 ms 14248 KB Output is correct
22 Correct 70 ms 14240 KB Output is correct
23 Correct 70 ms 14232 KB Output is correct
24 Correct 69 ms 14360 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 6800 KB Output is correct
6 Correct 4 ms 6760 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 3 ms 6796 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 5 ms 6744 KB Output is correct
14 Correct 7 ms 6744 KB Output is correct
15 Correct 3 ms 6744 KB Output is correct
16 Correct 3 ms 6732 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 7 ms 6780 KB Output is correct
19 Correct 3 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 79 ms 6772 KB Output is correct
22 Correct 3 ms 6744 KB Output is correct
23 Correct 35 ms 6748 KB Output is correct
24 Correct 4 ms 6744 KB Output is correct
25 Correct 3 ms 6732 KB Output is correct
26 Correct 27 ms 6748 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 5 ms 6748 KB Output is correct
29 Correct 8 ms 6748 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 4 ms 6792 KB Output is correct
32 Correct 3 ms 6744 KB Output is correct
33 Correct 34 ms 6748 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 7 ms 6748 KB Output is correct
36 Correct 3 ms 6748 KB Output is correct
37 Correct 3 ms 6736 KB Output is correct
38 Correct 3 ms 6744 KB Output is correct
39 Correct 16 ms 6800 KB Output is correct
40 Correct 3 ms 6744 KB Output is correct
41 Correct 5 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 193 ms 6748 KB Output is correct
44 Correct 3 ms 6724 KB Output is correct
45 Correct 3 ms 6748 KB Output is correct
46 Correct 4 ms 6732 KB Output is correct
47 Correct 3 ms 6748 KB Output is correct
48 Correct 3 ms 6744 KB Output is correct
49 Correct 103 ms 6776 KB Output is correct
50 Correct 3 ms 6744 KB Output is correct
51 Correct 3 ms 6748 KB Output is correct
52 Correct 3 ms 6732 KB Output is correct
53 Correct 5 ms 6952 KB Output is correct
54 Correct 4 ms 7000 KB Output is correct
55 Correct 3 ms 6748 KB Output is correct
56 Correct 3 ms 6748 KB Output is correct
57 Correct 3 ms 6748 KB Output is correct
58 Correct 3 ms 6748 KB Output is correct
59 Correct 72 ms 14164 KB Output is correct
60 Correct 71 ms 14164 KB Output is correct
61 Correct 71 ms 14160 KB Output is correct
62 Correct 71 ms 14380 KB Output is correct
63 Correct 72 ms 14360 KB Output is correct
64 Correct 73 ms 14356 KB Output is correct
65 Correct 78 ms 14228 KB Output is correct
66 Correct 77 ms 14160 KB Output is correct
67 Correct 73 ms 14368 KB Output is correct
68 Correct 74 ms 14160 KB Output is correct
69 Correct 75 ms 14164 KB Output is correct
70 Correct 73 ms 14228 KB Output is correct
71 Correct 79 ms 14360 KB Output is correct
72 Correct 74 ms 14416 KB Output is correct
73 Correct 76 ms 14372 KB Output is correct
74 Correct 72 ms 14240 KB Output is correct
75 Correct 73 ms 14160 KB Output is correct
76 Correct 76 ms 12628 KB Output is correct
77 Correct 76 ms 12976 KB Output is correct
78 Correct 73 ms 12708 KB Output is correct
79 Correct 77 ms 12624 KB Output is correct
80 Correct 74 ms 13092 KB Output is correct
81 Correct 76 ms 13736 KB Output is correct
82 Correct 73 ms 13792 KB Output is correct
83 Correct 72 ms 13868 KB Output is correct
84 Correct 74 ms 13648 KB Output is correct
85 Correct 72 ms 13844 KB Output is correct
86 Correct 74 ms 13940 KB Output is correct
87 Correct 73 ms 13648 KB Output is correct
88 Correct 72 ms 13852 KB Output is correct
89 Correct 83 ms 13652 KB Output is correct
90 Correct 77 ms 13648 KB Output is correct
91 Correct 79 ms 13648 KB Output is correct
92 Correct 78 ms 13788 KB Output is correct
93 Correct 71 ms 13652 KB Output is correct
94 Correct 71 ms 13736 KB Output is correct
95 Correct 72 ms 13728 KB Output is correct
96 Correct 72 ms 13864 KB Output is correct
97 Correct 93 ms 13720 KB Output is correct
98 Correct 88 ms 13800 KB Output is correct
99 Correct 275 ms 13924 KB Output is correct
100 Correct 72 ms 13824 KB Output is correct
101 Correct 72 ms 13648 KB Output is correct
102 Correct 76 ms 13716 KB Output is correct
103 Correct 74 ms 13776 KB Output is correct
104 Correct 74 ms 13724 KB Output is correct
105 Correct 72 ms 13648 KB Output is correct
106 Correct 74 ms 13848 KB Output is correct
107 Correct 73 ms 13848 KB Output is correct
108 Correct 73 ms 13652 KB Output is correct
109 Correct 88 ms 13860 KB Output is correct
110 Correct 81 ms 13864 KB Output is correct
111 Correct 73 ms 13652 KB Output is correct
112 Correct 71 ms 13652 KB Output is correct
113 Correct 74 ms 13904 KB Output is correct
114 Correct 88 ms 13868 KB Output is correct
115 Correct 80 ms 12628 KB Output is correct
116 Correct 80 ms 13888 KB Output is correct
117 Execution timed out 3097 ms 13648 KB Time limit exceeded
118 Halted 0 ms 0 KB -