19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T6cc,#include #include #include #include int N; int count; std::vector > vec2; std::vector > findPos; bool Queen(int x, int y) { if (vec2.size() > 0) { for (int i = 0; i < vec2.size(); ++i) { if (vec2[i].first == x || vec2[i].second == y || abs(vec2[i].first - x) == abs(vec2[i].second - y)) { return false; } } return true; } else { return true; } } void backtracking(int x, int y ,int length, int depth) { //std::cout << "depth " << depth << "\n"; for (int i = x; i < length; ++i) { for (int j = 0; j < length; ++j) { //std::cout << " (" << i << "," << j << ")\n"; // if (std::find(findPos.begin(), findPos.end(), std::pair(i, j)) == findPos.end()) { if (Queen(i, j)) { if (depth > -1) { vec2.push_ba

제출 #36572

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: