# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492193 | Tox123 | Cutting a rectangle (LMIO18_staciakampis) | C++11 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 = 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<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<PossibleR.size();i++){
Output.push_front(min(PossibleR.at(i).first,PossibleR.at(i).second));
}
Output.sort();
for(int i : Output){cout << i << endl;};
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |