Submission #1095904

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1095904	2024-10-03 11:39:49	alexander707070	Scissors and Tape (CEOI19_scissors)	C++14	0 / 100	1071 ms	111956 KiB

scissors

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#define MAXN 600007
using namespace std;
struct point{
    int x,y;
}p[10],q[10];
int n,m,al,bl,aw,bw;
void solve(int id,int ax,int ay,int al,int aw,int bx,int by,int bl,int bw){
    if(al==bl and aw==bw)return;
    if(al>bl){
        swap(al,bl); swap(aw,bw);
        swap(ax,bx); swap(ay,by);
    }
    int k=aw/bw+(aw%bw!=0);
    cout<<"scissors\n";
    cout<<id<<" "<<k<<"\n";
    for(int i=0;i<k;i++){
        if(i<k-1 or (aw%bw==0))cout<<ax<<" "<<ay+i*bw<<" "<<ax+al<<" "<<ay+i*bw<<" "<<ax+al<<" "<<ay+(i+1)*bw<<" "<<ax<<" "<<ay+(i+1)*bw<<"\n";
        else{
            cout<<ax<<" "<<ay+i*bw<<" "<<ax+al<<" "<<ay+i*bw<<" "<<ax+al<<" "<<ay+aw<<" "<<ax<<" "<<ay+aw<<"\n";
        }
    }
    cout<<"tape\n";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 10
• Subtask 6: 0 / 16
• Subtask 7: 0 / 11
• Subtask 8: 0 / 19