oj.uz

Submission #880770

# Submission time Handle Problem Language Result Execution time Memory
880770 2023-11-30T03:25:22 Z abcvuitunggio Hamburg Steak (JOI20_hamburg) C++17
6 / 100
 76 ms 13884 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
int n,k,l[200001],d[200001],r[200001],u[200001];
vector <pair <int, int>> res;
vector <int> v;
bool solve(vector <int> v, int k){
    if (v.empty()){
        while (k--)
            res.push_back({1,1});
        return true;
    }
    if (!k)
        return false;
    int mn=INF,mx=0,mn2=INF,mx2=0;
    for (int i:v){
        mn=min(mn,r[i]);
        mx=max(mx,l[i]);
        mn2=min(mn2,u[i]);
        mx2=max(mx2,d[i]);
    }
    vector <int> a,b;
    a.push_back(mn);
    b.push_back(mn2);
    if (mn<mx)
        a.push_back(mx);
    if (mn2<mx2)
        b.push_back(mx2);
    for (int i=0;i<(1<<(a.size()));i++)
        for (int j=0;j<(1<<(b.size()));j++){
            vector <pair <int, int>> tmp;
            for (int k=0;k<a.size();k++)
                for (int l=0;l<b.size();l++)
                    if (((i>>k)&1)^((j>>l)&1))
                        tmp.push_back({a[k],b[l]});
            if (max(a.size(),b.size())>tmp.size()||tmp.size()>k)
                continue;
            vector <int> v2;
            for (int i:v){
                int ch=0;
                for (auto [x,y]:tmp)
                    if (l[i]<=x&&x<=r[i]&&d[i]<=y&&y<=u[i])
                        ch=1;
                if (!ch)
                    v2.push_back(i);
            }
            if (solve(v2,k-tmp.size())){
                for (auto [x,y]:tmp)
                    res.push_back({x,y});
                return true;
            }
        }
    return false;
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n >> k;
    for (int i=0;i<n;i++){
        cin >> l[i] >> d[i] >> r[i] >> u[i];
        v.push_back(i);
    }
    bool tmp=solve(v,k);
    for (auto [x,y]:res)
        cout << x << ' ' << y << '\n';
}

Compilation message

hamburg.cpp: In function 'bool solve(std::vector<int>, int)':
hamburg.cpp:32:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for (int k=0;k<a.size();k++)
      |                          ~^~~~~~~~~
hamburg.cpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |                 for (int l=0;l<b.size();l++)
      |                              ~^~~~~~~~~
hamburg.cpp:36:62: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |             if (max(a.size(),b.size())>tmp.size()||tmp.size()>k)
      |                                                    ~~~~~~~~~~^~
hamburg.cpp: In function 'int main()':
hamburg.cpp:62:10: warning: unused variable 'tmp' [-Wunused-variable]
   62 |     bool tmp=solve(v,k);
      |          ^~~

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2496 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Incorrect 1 ms 2396 KB Unexpected end of file - int32 expected
9 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Incorrect 3 ms 2652 KB Unexpected end of file - int32 expected
9 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 76 ms 12852 KB Output is correct
6 Correct 62 ms 12980 KB Output is correct
7 Correct 62 ms 13024 KB Output is correct
8 Correct 70 ms 13564 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2524 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2576 KB Output is correct
5 Correct 71 ms 13780 KB Output is correct
6 Correct 67 ms 13164 KB Output is correct
7 Correct 72 ms 13884 KB Output is correct
8 Correct 70 ms 13712 KB Output is correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2496 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Incorrect 1 ms 2396 KB Unexpected end of file - int32 expected
9 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Incorrect 3 ms 2652 KB Unexpected end of file - int32 expected
9 Halted 0 ms 0 KB -