Submission #519796

#TimeUsernameProblemLanguageResultExecution timeMemory
519796MonarchuwuScissors and Tape (CEOI19_scissors)C++17
0 / 100
1085 ms107236 KiB
#include<iostream> #include<algorithm> #include<vector> using namespace std; typedef long long ll; typedef pair<int, int> pii; #define ff first #define ss second const int N = 1000; int n, m; vector<pii> S, T; void scissors() { cout << "scissors\n"; cout << "0 " << n * m << '\n'; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) { cout << "4 "; cout << i << ' ' << j << ' '; cout << i << ' ' << j + 1 << ' '; cout << i + 1 << ' ' << j + 1 << ' '; cout << i + 1 << ' ' << j << '\n'; } } void tape() { cout << "tape\n"; cout << m * n << ' '; for (int i = 1; i <= m * n; ++i) cout << i << ' '; cout << '\n'; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) { cout << "4 "; cout << i << ' ' << j << ' '; cout << i << ' ' << j + 1 << ' '; cout << i + 1 << ' ' << j + 1 << ' '; cout << i + 1 << ' ' << j << '\n'; } cout << "4\n"; for (pii x : T) cout << x.ff << ' ' << x.ss << ' '; cout << '\n'; } int main() { cin.tie(NULL)->sync_with_stdio(false); cin >> n; S.resize(n); for (pii &x : S) cin >> x.ff >> x.ss; cin >> m; T.resize(m); for (pii &x : T) cin >> x.ff >> x.ss; m = max({ S[0].ff, S[1].ff, S[2].ff }); n = max({ S[0].ss, S[1].ss, S[2].ss }); scissors(); tape(); } /** /\_/\ * (= ._.) * / >0 \>1 **/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...