Submission #9525

#TimeUsernameProblemLanguageResultExecution timeMemory
9525dominyellowWiring (kriii2_W)C++98
0 / 4
1000 ms35000 KiB
#include <stdio.h> #include <map> #include <queue> #include <set> #include <vector> using namespace std; int main(void){ int N; scanf("%d", &N); map<int, int> q_map; q_map[0] = 0; map<pair<int, int>, bool> line_map; int line_count = 0; int i; for(int i=1; i<=N*N; i++){ int q_i; q_i = (q_map[i-1]+i) % N; if(q_map.count(i) == 0){ q_map[i] = q_i; } if(q_map[i-1] != q_i){ if(line_map.count(make_pair(q_map[i-1], q_i)) == 0 && line_map.count(make_pair(q_i, q_map[i-1])) == 0){ line_map[make_pair(q_map[i-1], q_i)] = true; line_count += 1; } } } printf("%d\n", line_count); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...