Submission #535931

#	Time	Username	Problem	Language	Result	Execution time	Memory
535931		Wael	Broken Line (IOI19_line)	Text	0 / 100	0 ms	0 KiB

01.out

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define endl '\n'
#define all(v) v.begin() , v.end()
#define int long long
int const M = 1e6 , mod = 1e9 + 7 , N = 5e4 + 25;
ll T , n , d , x , y , In[M] , Out[M];
pair<ll , ll>p[M];

main() {
  ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);

  cin >> n;
  for(int i = 1 ; i <= n ; ++i) cin >> p[i].F >> p[i].S;

  sort(p + 1 , p + n + 1);

  ll x = 0 , y = 0;
  cout << 2 * n << endl;
  for(int i = 1 ; i <= n ; ++i) {
    cout << p[i].F << " " << y << endl;
    cout << p[i].F << " " << p[i].S << endl;
    x = p[i].F;
    y = p[i].S;
  }

  return 0;
}

02.out

03.out

04.out

05.out

06.out

07.out

08.out

09.out

10.out

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define endl '\n'
#define all(v) v.begin() , v.end()
#define int long long
int const M = 1e6 , mod = 1e9 + 7 , N = 5e4 + 25;
ll T , n , d , x , y , In[M] , Out[M];
pair<ll , ll>p[M];

main() {
  ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);

  cin >> n;
  for(int i = 1 ; i <= n ; ++i) cin >> p[i].F >> p[i].S;

  sort(p + 1 , p + n + 1);

  ll x = 0 , y = 0;
  cout << 2 * n << endl;
  for(int i = 1 ; i <= n ; ++i) {
    cout << p[i].F << " " << y << endl;
    cout << p[i].F << " " << p[i].S << endl;
    x = p[i].F;
    y = p[i].S;
  }

  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10