oj.uz

Submission #45752

# Submission time Handle Problem Language Result Execution time Memory
45752 2018-04-16T05:41:23 Z mirbek01 Palembang Bridges (APIO15_bridge) C++17
17 / 100
 2000 ms 2500 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, k, s[N], f[N];
long long ans = 1e18;
char a[N], b[N];
vector <int> v;

int main(){
      cin >> k >> n;

      for(int i = 1; i <= n; i ++){
            cin >> a[i] >> s[i] >> b[i] >> f[i];
            v.push_back(s[i]);
            v.push_back(f[i]);
      }
      for(int i = 0; i < v.size(); i ++){
            long long res = 0;
            int x = v[i];
            for(int j = 1; j <= n; j ++){
                  if(a[j] == b[j]){
                        res += abs(s[j] - f[j]);
                  } else {
                        res += abs(s[j] - x) + abs(x - f[j]) + 1;
                  }
            }
            ans = min(ans, res);
      }
      if(k == 2){
            for(int i = 0; i < v.size(); i ++){
                  for(int j = i + 1; j < v.size(); j ++){
                        long long res = 0;
                        for(int k = 1; k <= n; k ++){
                              if(a[k] == b[k]){
                                    res += abs(s[k] - f[k]);
                              } else {
                                    res += min( abs(s[k] - v[i]) + abs(f[k] - v[i]) + 1, abs(s[k] - v[j]) + abs(f[k] - v[j]) + 1);
                              }
                        }
                        ans = min(ans, res);
                  }
            }
      }

      cout << ans << endl;
}
/***
2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
***/

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:20:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < v.size(); i ++){
                      ~~^~~~~~~~~~
bridge.cpp:33:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < v.size(); i ++){
                            ~~^~~~~~~~~~
bridge.cpp:34:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                   for(int j = i + 1; j < v.size(); j ++){
                                      ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 8 ms 468 KB Output is correct
4 Correct 8 ms 484 KB Output is correct
5 Correct 8 ms 484 KB Output is correct
6 Correct 8 ms 616 KB Output is correct
7 Correct 8 ms 616 KB Output is correct
8 Correct 13 ms 616 KB Output is correct
9 Correct 8 ms 616 KB Output is correct
10 Correct 8 ms 616 KB Output is correct
11 Correct 8 ms 712 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 712 KB Output is correct
2 Correct 2 ms 712 KB Output is correct
3 Correct 7 ms 712 KB Output is correct
4 Correct 9 ms 712 KB Output is correct
5 Correct 8 ms 712 KB Output is correct
6 Correct 8 ms 712 KB Output is correct
7 Correct 9 ms 712 KB Output is correct
8 Correct 12 ms 712 KB Output is correct
9 Correct 8 ms 712 KB Output is correct
10 Correct 8 ms 712 KB Output is correct
11 Correct 14 ms 724 KB Output is correct
12 Execution timed out 2068 ms 2500 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2500 KB Output is correct
2 Correct 2 ms 2500 KB Output is correct
3 Correct 10 ms 2500 KB Output is correct
4 Correct 11 ms 2500 KB Output is correct
5 Correct 4 ms 2500 KB Output is correct
6 Correct 2 ms 2500 KB Output is correct
7 Correct 12 ms 2500 KB Output is correct
8 Correct 12 ms 2500 KB Output is correct
9 Correct 12 ms 2500 KB Output is correct
10 Correct 21 ms 2500 KB Output is correct
11 Correct 12 ms 2500 KB Output is correct
12 Correct 12 ms 2500 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2500 KB Output is correct
2 Correct 2 ms 2500 KB Output is correct
3 Correct 18 ms 2500 KB Output is correct
4 Correct 11 ms 2500 KB Output is correct
5 Correct 5 ms 2500 KB Output is correct
6 Correct 2 ms 2500 KB Output is correct
7 Correct 11 ms 2500 KB Output is correct
8 Correct 12 ms 2500 KB Output is correct
9 Correct 11 ms 2500 KB Output is correct
10 Correct 17 ms 2500 KB Output is correct
11 Correct 19 ms 2500 KB Output is correct
12 Correct 13 ms 2500 KB Output is correct
13 Execution timed out 2055 ms 2500 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2500 KB Output is correct
2 Correct 2 ms 2500 KB Output is correct
3 Correct 13 ms 2500 KB Output is correct
4 Correct 11 ms 2500 KB Output is correct
5 Correct 6 ms 2500 KB Output is correct
6 Correct 2 ms 2500 KB Output is correct
7 Correct 15 ms 2500 KB Output is correct
8 Correct 11 ms 2500 KB Output is correct
9 Correct 11 ms 2500 KB Output is correct
10 Correct 13 ms 2500 KB Output is correct
11 Correct 12 ms 2500 KB Output is correct
12 Correct 11 ms 2500 KB Output is correct
13 Execution timed out 2058 ms 2500 KB Time limit exceeded
14 Halted 0 ms 0 KB -