oj.uz

답안 #524213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524213 2022-02-08T19:36:00 Z ammar2000 Tower Defense (CEOI19_towerdefense) C++17
0 / 100
 1 ms 312 KB 
#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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Distance from entrance to home is not d.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 1 ms 204 KB Expected but did not find "impossible".
15 Halted 0 ms 0 KB -

Subtask #3
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Distance from entrance to home is not d.
3 Halted 0 ms 0 KB -