# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492193 | 2021-12-05T21:44:12 Z | Tox123 | Cutting a rectangle (LMIO18_staciakampis) | C++11 | 1 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 = 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |