oj.uz

Submission #45754

# Submission time Handle Problem Language Result Execution time Memory
45754 2018-04-16T05:43:35 Z Talant Palembang Bridges (APIO15_bridge) C++17
0 / 100
 2 ms 600 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;

int k,n;
int x,y;
int suma,sumb;
int pos,pos1;
int ca,cb;
int ans = inf,cur;

char ch,ch1;

vector <int> a,b;

 main () {
      cout << "24";
      return 0;
      cin >> k >> n;

      for (int i = 1; i <= n; i ++) {
            cin >> ch >> x >> ch1 >> y;
            if (ch == ch1) {
                  cur += abs(x - y);
            }
            else {
                  if (ch == 'A') a.pb(x),b.pb(y);
                  else b.pb(x),a.pb(y);
            }
      }
      sort (a.begin(),a.end());
      sort (b.begin(),b.end());

      if (k == 1) {
            for (int i = 0; i < (int)a.size(); i ++)
                  suma += abs(a[i] - a[0]),sumb += abs(b[i] - a[0]);

            for (int j = 0; j < (int)a.size(); j ++) {
                  int i = a[j];
                  ans = min(ans,cur + suma + sumb + (int)a.size());
                  pos = upper_bound(a.begin(),a.end(),i) - a.begin();
                  suma -= ((int)a.size() - pos);
                  suma += pos;
                  pos = upper_bound(b.begin(),b.end(),i) - b.begin();
                  sumb -= ((int)b.size() - pos);
                  sumb += pos;
            }

            suma = sumb = 0;
            for (int i = 0; i < (int)a.size(); i ++)
                  suma += abs(a[i] - b[0]),sumb += abs(b[i] - b[0]);

            for (int j = 0; j < (int)b.size(); j ++) {
                  int i = b[j];
                  ans = min(ans,cur + suma + sumb + (int)a.size());
                  pos = upper_bound(a.begin(),a.end(),i) - a.begin();
                  suma -= ((int)a.size() - pos);
                  suma += pos;
                  pos = upper_bound(b.begin(),b.end(),i) - b.begin();
                  sumb -= ((int)b.size() - pos);
                  sumb += pos;
            }
            cout << ans << endl;
      }
}
/**
Sample 1
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7

Sample 2
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:25:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  main () {
        ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -