oj.uz

답안 #516646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516646 2022-01-21T17:47:55 Z Tox123 Cutting a rectangle (LMIO18_staciakampis) C++17
0 / 100
 1 ms 208 KB 
#include <iostream>
#include <list>
#include <vector>

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));
            continue;
        }
        vector<pair<int, int>> OtherPossibleR;
        for(int x = 0;x < CurrentPossibleRSize;x++){
            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));
            }
        }
        PossibleR = OtherPossibleR;
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -