| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1237253 | _snoopy_ | Kutije (COCI21_kutije) | C++20 | 428 ms | 1816 KiB |
#include <bits/stdc++.h>
using namespace std;
long long int arr[1000010];
int main(){
long long int n, m, q, i, a, v;
cin>>n>>m>>q;
if(m==1){
for(i=0; i<n; i++){
cin>>arr[i];
}
for(i=0; i<q; i++){
long long int b, a;
cin>>a>>b;
if(b==arr[a-1]){
cout<<"DA"<<endl;
}
else{
cout<<"NE"<<endl;
}
}
}
else{
return 0;
}
return 0;
}
| # | 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... | ||||
