Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20813 | 2024-06-08 22:46:02 | AHAMMED_99 | Cheaters | C | 1100 ms | 596 kb | Time Limit Exceeded - 1 |
Source Code
#include <stdio.h> void find_cheater_order(int t, int test_cases[][51]) { for (int x = 0; x < t; x++) { int n = test_cases[x][0]; int cheaters[50]; for (int i = 0; i < n; i++) { cheaters[i] = test_cases[x][i+1]; } int order[50] = {0}; for (int i = 0; i < n; i++) { order[i] = cheaters[i]; } int result[50] = {0}; for (int i = 0; i < n; i++) { int curr = i; while (order[curr] != 0) { curr = order[curr] - 1; } result[i] = curr + 1; } for (int i = 0; i < n; i++) { } } } int main() { int t; int test_cases[20][51]; for (int i = 0; i < t; i++) { int n; test_cases[i][0] = n; for (int j = 0; j < n; j++) { } } find_cheater_order(t, test_cases); return 0; }