1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T525,#include using namespace std; #define int long long #define uniqueize(x) \ sort(x.begin(), x.end()); \ x.erase(unique(x.begin(), x.end()), x.end()) struct point { int x, y; bool operator<(const point &p) const { return x < p.x || (x == p.x && y < p.y); } bool operator==(const point &p) const { return x == p.x && y == p.y; } }; int dx[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy[] = {1, 1, 0, -1, -1, -1, 0, 1}; int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; point cur = {0, 0}; vector v({{0, 0}}); vector> e; string s; cin >> s; for(char c: s) { int dir = c - '0'; point nxt = {cur.x + dx[dir], cur.y + dy[dir]}; v.push_back(nxt); e.push_back(cur < nxt ? make_pair(cur, nxt) : make_pair(nxt, cur)); cur = nxt; } uniqueize(v); uniqueize(e); int cross = 0; for(int i = 0; i < e.size(); i++) { auto [a, b] = e[i]; if(a.x + 1 == b.x && a.y + 1 == b.y) { point c = {a.x, a.y + 1}; point d = {a.x + 1, a.y}; if(binary_search(e.begin(), e.end(), make_pair(c, d))) { cross++; } } } cout << 1 + e.size() - v.size() + cross; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","children":[["

코드 #3454