Submission #1267638

#	Time	Username	Problem	Language	Result	Execution time	Memory
1267638		sssswwwppp	main 함수 (BSC_0_0)	C++20	100 / 100	0 ms	320 KiB

main

#include <bits/stdc++.h>
using namespace std;

template<typename T>
ostream &operator<<(ostream &stream, vector<T> &vec) {
    for (auto &b : vec) stream << b << " ";
    cout << '\n';
    return stream;
}

template<typename T>
istream &operator>>(istream &stream, vector<T> &vec) {
    for (auto &b : vec) stream >> b;
    return stream;
}

template<typename T1, typename T2>
inline void amin(T1 &a, T2 b) {
    a = min(a, b);
}

template<typename T1, typename T2>
inline void amax(T1 &a, T2 b) {
    a = max(a, b);
}
void goans(int x) {
    if (x) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
}

//#define int unsigned int
//#define int int64_t
#define all(x) x.begin(), x.end()
#define deb cout << "-----------------" << endl;
#define sz(x) (int)(x.size())
#define pb emplace_back
#define ff first
#define ss second
#define push emplace
#define sj(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define MINID(a) min_element(all(a)) - a.begin()
#define MAXID(a) max_element(all(a)) - a.begin()
#define SUM(a) accumulate(all(a), 0LL)
#define mp make_pair

mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<double> rng(0, 1);

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pi = pair<int, int>;
using i128 = __int128;
using vpi = vector<pi>;
using vvpi = vector<vpi>;

const int64_t INF = 1e18;
const int INF2 = 1e9;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
const int hashmod = 1e9 + 3111;
//const int p = 214333;

const int N = 2e6;
const int D = 458;

//NO HINTS!!!
//without #define int long long

void solve() {
    
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
}

• Subtask 1: 100 / 100