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:T515,#include using namespace std; const int MX = 500; int lb[MX][MX], lu[MX][MX], ru[MX][MX], rb[MX][MX]; struct Point{ int x, y; Point operator-(Point a) { return {x-a.x,y-a.y}; } }; int cross(Point p, Point q) { return p.x*q.y-p.y*q.x; } int ccw(Point A, Point B, Point C) { int c = cross(B-A, C-B); if(c > 0) return 1; // ccw else if(c < 0) return -1; // cw else return 0; // colinear } Point arr[MX]; int val[MX]; int main() { ios::sync_with_stdio(0);cin.tie(0); int n, m; cin >> n >> m; int total = 0; for(int i=0; i> arr[i].x >> arr[i].y >> val[i]; total += val[i]; } for(int x=1; x

코드 #4824