oj.uz

Submission #499486

# Submission time Handle Problem Language Result Execution time Memory
499486 2021-12-28T13:55:53 Z AramJ Kutije (COCI21_kutije) C++14
0 / 70
 22 ms 32136 KB 
#include <iostream>
#include <map>
using namespace std;
int main(){
int n,m,q;
cin>>n>>m>>q;
int c[n];
pair<int,int>pa[n];
for(int i=0;i<n;i++){
    cin>>c[i];
    pa[i].first=i+1;
    pa[i].second=c[i];
}
int h,f;
string a[q];
for(int i=0;i<q;i++){
   cin>>h>>f;
   if(h==pa[i].first&&f==pa[i].second) {
        a[i]="DA";
    }
   else if (h==pa[i].second&&f==pa[i].first){
    a[i]="DA";
   }
   else{
    a[i]="NE";
   }
}
for(int i=0;i<q;i++){
    cout<<a[i]<<endl;
}
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 32136 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 32136 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -