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:T744,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of markets int N = rnd.next(1, 10); // Fuel costs int U = rnd.next(1, 10); int D = rnd.next(1, U); // Home position int S = rnd.next(2, 50); // Maximum possible position for markets int maxPos = S + N + 5; // Determine how many markets upstream (L < S) and downstream (L > S) int upCount, downCount; if (N > 1) { upCount = rnd.next(1, min(N - 1, S - 1)); } else { upCount = rnd.next(0, 1); } downCount = N - upCount; // Generate unique positions vector upCands; for (int x = 1; x < S; ++x) upCands.push_back(x); shuffle(upCands.begin(), upCands.end()); vector positions; for (int i = 0; i < upCount; ++i) positions.push_back(upCands[i]); vector downCands; for (int x = S + 1; x <= maxPos; ++x) downCands.push_back(x); shuffle(downCands.begin(), downCands.end()); for (int i = 0; i < downCount; ++i) positions.push_back(downCands[i]); // Hyperparameters for days and profits int maxDay = max(1, N * 3); vector tOptions = { -2, -1, 1, 2 }; vector mOptions = { -1, 1 }; // Build market list vector> markets; for (int i = 0; i < N; ++i) { int tBias = rnd.any(tOptions); int T =

코드 #6372