# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
499493 |
2021-12-28T14:03:55 Z |
Abito |
Kutije (COCI21_kutije) |
C++14 |
|
1000 ms |
17460 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,q;
cin>>n>>m>>q;
map<int,pair<int,int>> x;
for (int i=1;i<=n;i++)
{
x[i].first=i;
}
int c;
for (int i=1;i<=n;i++)
{
cin>>c;
x[i].second=c;
}
int a,b;
string ans[q];
while (q--)
{
cin>>a>>b;
if (x[a].first==b || x[a].second==b)
{
cout<<"DA"<<endl;
}
else
cout<<"NE"<<endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1010 ms |
17460 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1010 ms |
17460 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |