제출 #1241085

#제출 시각아이디문제언어결과실행 시간메모리
1241085aminabouakazInfinite Race (EGOI24_infiniterace2)C++17
0 / 100
0 ms328 KiB
#include <iostream> #include <unordered_map> using namespace std; int main() { int N, Q; cin >> N >> Q; unordered_map<int, int> lap_diff; int min_laps = 0; for (int i = 0; i < Q; ++i) { int x; cin >> x; if (x > 0) { if (lap_diff[x] > min_laps) { min_laps = lap_diff[x]; } } else { x = -x; lap_diff[x] = min_laps + 1; } } cout << min_laps << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...