Submission #1147897

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147897		njoop	오벨리스크 (NOI14_obelisk)	C++17	0 / 25	1 ms	1608 KiB

obelisk

#include <bits/stdc++.h>
#define int long long
#define ti tuple<int, int, int>
using namespace std;

const int mxf = 505, mxh = 105;
int k, m, h, cx, cy, cd, cf, ch, nd, nf, nh, sp[mxf][mxh];
vector<pair<int, int>> fl[mxf];
vector<ti> g[mxf][mxh];
priority_queue<ti, vector<ti>, greater<ti>> pq;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> k >> m;
    cin >> cx >> cy;
    cout << sp[k][0];
    return 0;
}

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