oj.uz

Submission #87601

# Submission time Handle Problem Language Result Execution time Memory
87601 2018-12-01T11:39:31 Z Bevanda Olivander (COCI18_olivander) C++14
50 / 50
 3 ms 672 KB 
#include <bits/stdc++.h>

using namespace std;

int N, s[103], k[103];

int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);
  
  cin >> N;
  for (int i = 0; i < N; ++i)
    cin >> s[i];
  for (int i = 0; i < N; ++i)
    cin >> k[i];
  sort(s, s + N);
  sort(k, k + N);
  
  int ok = 1;
  for (int i = 0; i < N; ++i)
    if (s[i] > k[i])
      ok = 0;
    
    if (ok == 1)
      cout << "DA";
    else 
      cout << "NE";

  return 0;
}

Compilation message

olivander.cpp: In function 'int main()':
olivander.cpp:21:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for (int i = 0; i < N; ++i)
   ^~~
olivander.cpp:25:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     if (ok == 1)
     ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 376 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 448 KB Output is correct
2 Correct 2 ms 524 KB Output is correct

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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