oj.uz

Submission #492196

# Submission time Handle Problem Language Result Execution time Memory
492196 2021-12-05T21:56:18 Z Tox123 Cutting a rectangle (LMIO18_staciakampis) C++11
0 / 100
 0 ms 204 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <utility>

using namespace std;

int main(){
    int n; cin >> n;
    vector<pair<int, int>> PossibleR;
    for(int i = 0;i<n;i++){
        int a, b; cin >> a >> b;
        int CurrentPossibleRSize = static_cast<int>(PossibleR.size());
        if(CurrentPossibleRSize==0){
            PossibleR.push_back(make_pair(a,b));
        }else{
            for(int x = 0;x < CurrentPossibleRSize;x++){
                vector<pair<int, int>> OtherPossibleR;
                //int a1 = PossibleR.at(x).first;int b1 = PossibleR.at(x).second;
                if(PossibleR.at(x).first==a){
                    OtherPossibleR.push_back(make_pair(a,PossibleR.at(x).second+b));
                }
                if(PossibleR.at(x).second==a){
                    OtherPossibleR.push_back(make_pair(PossibleR.at(x).first+b,a));
                }
                if(PossibleR.at(x).first==b){
                    OtherPossibleR.push_back(make_pair(b,PossibleR.at(x).second+a));
                }
                if(PossibleR.at(x).second==b){
                    OtherPossibleR.push_back(make_pair(PossibleR.at(x).first+a,b));
                }
                bool AlreadyHadValue = false;
                for(int z = 0;z<static_cast<int>(OtherPossibleR.size());z++){
                    if(AlreadyHadValue==false){
                        PossibleR.at(x) = OtherPossibleR.at(z);
                    }else{
                        PossibleR.push_back(OtherPossibleR.at(z));
                    }
                    AlreadyHadValue = true;
                }
            }
        }
    }
    cout << PossibleR.size() << endl;
    list<int> Output;
    for(int i =0;i<static_cast<int>(PossibleR.size());i++){
        Output.push_front(min(PossibleR.at(i).first,PossibleR.at(i).second));
    }
    Output.sort();
    int LastNum = 0;
    for(int i : Output){
        if(LastNum==i){continue;};
        LastNum = i;
        cout << i << endl;
    }
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -