This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <bitset>
#include <array>
constexpr int MAX_K = 3000;
int main()
{
std::cin.tie(0)->sync_with_stdio(0);
// O(N^2 K/w)
int N,K,Q;
std::cin >> N >> K >> Q;
std::vector<int> A(N);
for(auto& i : A) std::cin >> i;
for(auto& i : A) i--;
std::vector<int> works_max(N);
for(int x = 0; x < N; x++)
{
std::array<std::array<std::bitset<MAX_K>,MAX_K>,2> ltgt;
works_max[x] = x;
bool g = 1;
for(int y = x+1; y < N; y++,g = !g)
{
auto a = A[y];
auto p = A[y-1];
ltgt[g][a] |= ltgt[g][p];
ltgt[g][a][p] = true;
if((ltgt[0][a]<gt[1][a]).any() || ltgt[0][a][a] || ltgt[1][a][a]) break;
works_max[x] = y;
}
}
for(auto i : works_max) std::cerr << i << "\n";
for (int i = 0; i < Q; i++)
{
int x,y;
std::cin >> x >> y;
x--;y--;
std::cout << (works_max[x]>=y ? "YES" : "NO") << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |