알고리즘62 Softeer / [인증평가(5차) 기출] 성적 평가 https://softeer.ai/practice/info.do?idx=1&eid=1309&sw_prbl_sbms_sn=125417 #include #include #include #include using namespace std; using vi = vector; using vvi = vector; vi f(vi &records) { int N = records.size(); vi sorted = records; sort(sorted.begin(), sorted.end()); map table; int prev = 1001; for (int i = 0; i < N; ++i) { if (sorted[i] == prev) continue; table[sorted[i]] = i + 1; prev = sor.. 2023. 1. 8. BOJ / 감시 https://www.acmicpc.net/problem/15683 #include #include #include using namespace std; int N, M; int ans; const int DIR[] = { -1, 0, 1, 0,-1 }; vector cctv; void count(vector &grid) { int c = 0; for (int i = 0; i c) print(grid); ans = min(ans, c); } bool isValid(int y, int x) { return 0 = 3) fillLine(grid, cur, (dir +.. 2022. 12. 19. Softeer / [인증평가(4차) 기출] 통근버스 출발 순서 검증하기 https://softeer.ai/practice/info.do?idx=1&eid=654&sw_prbl_sbms_sn=111741 #include #include #include using namespace std; int main(int argc, char** argv) { int N; cin >> N; vector in(N); vector pos(N); for (int i = 0; i > in[i]; --in[i]; pos[in[i]] = i; } long long ans = 0; for (int i = 0; i < N - 2; ++i) { int cur = in[i]; vector k_pos; for (int k = 0; k < cur; ++k) { if (pos[k].. 2022. 12. 16. Softeer / [인증평가(4차) 기출] 슈퍼컴퓨터 클러스터 https://softeer.ai/practice/info.do?idx=1&eid=1204 #include #include using namespace std; bool f(vector &A, long long B, long long n) { for (auto a : A) { if (a > N >> B; vector A(N); for (int i = 0; i > A[i]; long long right = 2e9; long long left = 1; while (left < right) .. 2022. 12. 14. 이전 1 2 3 4 5 ··· 16 다음