oj.uz

Submission #168306

# Submission time Handle Problem Language Result Execution time Memory
168306 2019-12-12T11:05:05 Z ArKCa Olivander (COCI18_olivander) C++17
30 / 50
 1000 ms 380 KB 
#include <bits/stdc++.h>
#define  ll  long long 
#define  mod 1000000007
#define  pb  push_back
#define  pob pop_back
#define  f1  first
#define  s2  second
#define  N   50
#define  ekle 200
using namespace std;

int n;

int dizi[N],dizim[N];

int main(){
	// freopen("a.gir","r",stdin);		
    // freopen("a.cik","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<n;i++){
    	scanf("%d",&dizi[i]);
    }
    sort(dizi,dizi+n);
    for(int i=0;i<n;i++){
    	scanf("%d",&dizim[i]);
    }
    sort(dizim,dizim+n);
    for(int i=0;i<n;i++){
    	if(dizi[i]>dizim[i]){
    		printf("NE\n");
    		return 0;
    	}
    }
    printf("DA\n");
}

Compilation message

olivander.cpp: In function 'int main()':
olivander.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
olivander.cpp:21:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d",&dizi[i]);
      ~~~~~^~~~~~~~~~~~~~~
olivander.cpp:25:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d",&dizim[i]);
      ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Execution timed out 1055 ms 376 KB Time limit exceeded

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -