oj.uz

Submission #42800

# Submission time Handle Problem Language Result Execution time Memory
42800 2018-03-04T04:44:23 Z funcsr Aliens (IOI16_aliens) C++14
0 / 100
 2 ms 572 KB 
#include "aliens.h"
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define INF 1145141919
#define _1 first
#define _2 second
inline void chmin(long long &x, long long v) { if (x > v) x = v; }

long long dp[100010][101];
int L[100010];
long long take_photos(int N, int M, int K, std::vector<int> R, std::vector<int> C) {
  vector<P> ps;
  rep(i, N) {
    int l = R[i], r = C[i];
    if (l > r) swap(l, r);
    ps.pb(P(l, -r));
  }
  sort(all(ps));
  int mr = -1;
  vector<P> nps;
  for (P p : ps) {
    if (-p._2 > mr) {
      nps.pb(P(p._1, -p._2));
      mr = -p._2;
    }
  }
  swap(ps, nps);
  rep(i, M) L[i] = i+1;
  for (P p : ps) {
    int l = p._1, r = p._2;
    for (int i=l; i<=r; i++) L[i] = min(L[i], l);
  }
  //rep(i, M) cout<<L[i]<<",";cout<<"\n";

  rep(i, M+1) rep(j, K+1) dp[i][j] = 1LL<<60;
  dp[0][0] = 0;
  rep(i, M) {
    rep(k, K) {
      rep(pos, i+1) {
        if (L[pos] == INF) continue;
        int l = L[pos], s = i-l+1;
        chmin(dp[i+1][k+1], dp[pos][k] + 1LL*s*s);
      }
    }
  }
  long long m = 1LL<<60;
  rep(k, K+1) chmin(m, dp[M][k]);
  return m;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Correct answer: answer = 4
2 Correct 2 ms 480 KB Correct answer: answer = 4
3 Correct 1 ms 480 KB Correct answer: answer = 4
4 Incorrect 1 ms 504 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 536 KB Correct answer: answer = 1
2 Correct 1 ms 556 KB Correct answer: answer = 4
3 Incorrect 1 ms 572 KB Wrong answer: output = 2, expected = 1
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Correct answer: answer = 4
2 Correct 2 ms 480 KB Correct answer: answer = 4
3 Correct 1 ms 480 KB Correct answer: answer = 4
4 Incorrect 1 ms 504 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Correct answer: answer = 4
2 Correct 2 ms 480 KB Correct answer: answer = 4
3 Correct 1 ms 480 KB Correct answer: answer = 4
4 Incorrect 1 ms 504 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Correct answer: answer = 4
2 Correct 2 ms 480 KB Correct answer: answer = 4
3 Correct 1 ms 480 KB Correct answer: answer = 4
4 Incorrect 1 ms 504 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Correct answer: answer = 4
2 Correct 2 ms 480 KB Correct answer: answer = 4
3 Correct 1 ms 480 KB Correct answer: answer = 4
4 Incorrect 1 ms 504 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -