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:T637,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameters for diversity within hand-verifiable limits vector Ns = {1, 2, 5, 10, 15}; vector Ms = {1, 2, 5, 10}; int N = rnd.any(Ns); int M = rnd.any(Ms); // profit[j][k]: profit for company j when investing k vector> profit(M, vector(N + 1, 0)); for (int j = 0; j < M; j++) { int pat = rnd.next(0, 2); if (pat == 0) { // Pure random profits for (int k = 1; k <= N; k++) { profit[j][k] = rnd.next(0, 100); } } else { // Convex or concave pattern via sorted marginal returns vector d(N); for (int i = 0; i < N; i++) { d[i] = rnd.next(1, 10); } if (pat == 1) { // Concave: decreasing marginal returns sort(d.begin(), d.end(), greater()); } else { // Convex: increasing marginal returns sort(d.begin(), d.end()); } long long s = 0; for (int k = 1; k <= N; k++) { s += d[k - 1]; profit[j][k] = s; } } } // Output println(N, M); for (int k = 1; k <= N; k++) { printf("%d", k);

코드 #5907