제출 #1000178

#제출 시각아이디문제언어결과실행 시간메모리
1000178Evirir9월 (APIO24_september)C++17
0 / 100
0 ms348 KiB
#include "september.h" #include <vector> #include <unordered_set> #define sz(x) (int)(x).size() int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { int ans = 0; int cnt = 0; std::unordered_set<int> s; for (int i = 0; i < sz(S[0]); i++) { cnt++; for (const auto& v : S) s.insert(v[i]); if (sz(s) == cnt) { ans++; s.clear(); cnt = 0; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...