Submission #1136414

#TimeUsernameProblemLanguageResultExecution timeMemory
1136414JahonaliXSeptember (APIO24_september)C++20
0 / 100
20 ms324 KiB
#include <bits/stdc++.h> using namespace std; int solve(int n, int m, vector<int> p, vector<vector<int>> s) { vector<set<int>> a(m); int k = 0; for (int i = 0; i < n - 1; ++i) { set<set<int>> p; for (int j = 0; j < m; ++j) a[j].insert(s[j][i]), p.insert(a[j]); k += p.size() == 1; } return k; }
#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...