제출 #524213

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
524213		ammar2000	Tower Defense (CEOI19_towerdefense)	C++17	0 / 100	1 ms	312 KiB

towerdefense

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll x,y,X,Y,d;
vector <pair <ll,ll> > ans;
int main()
{
   fast
   cin>>x>>y>>X>>Y>>d;
   ll des=abs(x-X)+abs(y-Y);
   if (d<des||(d-des)%2)
   {
       cout << "impossible\n";
       return 0;
   }
   des=d-des;
   if (x<X)
   {
      ans.pb({x+1,y});
      for (int i=-1;i<des/2-2;i++)
      {
          ans.pb({x-i,y+1});
          ans.pb({x-i,y-1});
      }
   }
   else
   {
       ans.pb({x-1,y});
      for (int i=-1;i<des/2-2;i++)
      {
          ans.pb({x+i,y+1});
          ans.pb({x+i,y-1});
      }
   }
   cout <<ans.size()<<"\n";
   for (auto i:ans)
    cout <<i.F<<" "<<i.S<<"\n";
   // use scanf not cin
   return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 28
• Subtask 3: 0 / 47