oj.uz

Submission #68693

# Submission time Handle Problem Language Result Execution time Memory
68693 2018-08-18T06:22:55 Z mirbek01 Simurgh (IOI17_simurgh) C++17
0 / 100
 3 ms 412 KB 
#include "simurgh.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> find_roads(int n, vector<int> u, vector<int> v) {
      vector <int> ans, id;
      int m = u.size();

      for(int i = 0; i < n - 1; i ++)
            ans.push_back(i);

      for(int i = 0; i < m; i ++)
            id.push_back(i);

      int ct = count_common_roads(ans);

      if(ct < n - 1){
            for(int i = 0; i < n - 1; i ++){
                  for(int j = 0; j < n - 1; j ++){
                        ans[j] = id[j];
                  }
                  int cn = count_common_roads(ans);
                  for(int j = n - 1; j < id.size(); j ++){
                        swap(id[i], id[j]);
                        for(int k = 0; k < n - 1; k ++){
                              ans[k] = id[k];
                        }
                        int cnt = count_common_roads(ans);
                        if(cnt > cn){
                              break;
                        }
                        swap(id[i], id[j]);
                  }
            }
      }

      for(int i = 0; i < n - 1; i ++)
            ans[i] = id[i];

      return ans;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:24:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                   for(int j = n - 1; j < id.size(); j ++){
                                      ~~^~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB correct
2 Incorrect 2 ms 412 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 248 KB WA in grader: NO
2 Halted 0 ms 0 KB -