제출 #1177677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177677		tamzid	Best Place (NOI17_bestplace)	C++20	3 / 100	0 ms	328 KiB

bestplace

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << endl;
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
    int n;
    cin>>n;
    ll a,b,c,d;
    cin>>a>>b;
    cin>>c>>d;
    cout<<(a+c)/2<<' '<<(b+d)/2;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 20
• Subtask 3: 0 / 28
• Subtask 4: 0 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19