oj.uz

Submission #48709

# Submission time Handle Problem Language Result Execution time Memory
48709 2018-05-18T09:08:30 Z faustaadp Aliens (IOI16_aliens) C++17
12 / 100
 184 ms 7048 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
#include "aliens.h"
ll d[550][1010],i,j,b[1010],te,N,me[1010][1010];
pair<ll,ll> a[1010];
ll inter(ll aa,ll bb)
{
    if(bb==N+1)
        return 0;
    if(a[aa].se<a[bb].fi||a[aa]==a[bb])
        return 0;
    return (a[bb].fi-a[aa].se+1)*(a[bb].fi-a[aa].se+1);
}
ll depe(ll aa,ll bb)
{
    if(aa==N+1)
        return 0;
    if(bb<=0)
        return 1e18;
    if(d[aa][bb]==-1)
    {
        d[aa][bb]=1e18;
        ll ii;
        for(ii=aa;ii<=N;ii++)
            d[aa][bb]=min(d[aa][bb],depe(ii+1,bb-1)+(a[ii].se-a[aa].fi+1)*(a[ii].se-a[aa].fi+1)-inter(ii,ii+1));
    }
    return d[aa][bb];
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        {
            ll Ki=min(r[i],c[i]);
            ll Ka=max(r[i],c[i]);
            if(Ki==min(r[j],c[j])&&Ka==max(r[j],c[j])&&i<=j)
                continue;
            if(Ki<=r[j]&&r[j]<=Ka&&Ki<=c[j]&&c[j]<=Ka)
                b[j]=1;
        }
    for(i=0;i<n;i++)
        if(!b[i]&&me[min(c[i],r[i])][max(r[i],c[i])]==0)
        {
            te++;
            a[te]=mp(min(r[i],c[i]),max(r[i],c[i]));
            me[min(c[i],r[i])][max(r[i],c[i])]=1;
        }
    memset(d,-1,sizeof(d));
    N=te;
    sort(a+1,a+1+N);
    for(i=1;i<N;i++)
        if(a[i].se>a[i+1].se)
            n=n/0;
 //   for(i=1;i<=N;i++)
 //       cout<<a[i].fi<<" "<<a[i].se<<"\n";
 //   cout<<N<<"\n";
    return depe(1,k);
}

Compilation message

aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:57:16: warning: division by zero [-Wdiv-by-zero]
             n=n/0;
               ~^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4600 KB Correct answer: answer = 4
2 Correct 5 ms 4712 KB Correct answer: answer = 4
3 Correct 5 ms 4916 KB Correct answer: answer = 4
4 Correct 6 ms 4916 KB Correct answer: answer = 12
5 Incorrect 5 ms 4916 KB Wrong answer: output = 64, expected = 52
6 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4916 KB Correct answer: answer = 1
2 Correct 5 ms 4916 KB Correct answer: answer = 4
3 Correct 5 ms 5080 KB Correct answer: answer = 1
4 Correct 5 ms 5080 KB Correct answer: answer = 5
5 Correct 5 ms 5080 KB Correct answer: answer = 41
6 Correct 5 ms 5080 KB Correct answer: answer = 71923
7 Correct 9 ms 5628 KB Correct answer: answer = 77137
8 Correct 86 ms 6528 KB Correct answer: answer = 764
9 Correct 8 ms 6912 KB Correct answer: answer = 250000
10 Correct 184 ms 7044 KB Correct answer: answer = 500
11 Correct 5 ms 7044 KB Correct answer: answer = 32
12 Correct 10 ms 7044 KB Correct answer: answer = 130050
13 Correct 65 ms 7044 KB Correct answer: answer = 5110
14 Correct 13 ms 7044 KB Correct answer: answer = 2626
15 Correct 22 ms 7044 KB Correct answer: answer = 796
16 Correct 38 ms 7044 KB Correct answer: answer = 7580
17 Correct 110 ms 7048 KB Correct answer: answer = 1904
18 Correct 7 ms 7048 KB Correct answer: answer = 996004
19 Correct 23 ms 7048 KB Correct answer: answer = 38817
20 Correct 57 ms 7048 KB Correct answer: answer = 4096
21 Correct 6 ms 7048 KB Correct answer: answer = 1
22 Correct 6 ms 7048 KB Correct answer: answer = 1
23 Correct 108 ms 7048 KB Correct answer: answer = 2040
24 Correct 6 ms 7048 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4600 KB Correct answer: answer = 4
2 Correct 5 ms 4712 KB Correct answer: answer = 4
3 Correct 5 ms 4916 KB Correct answer: answer = 4
4 Correct 6 ms 4916 KB Correct answer: answer = 12
5 Incorrect 5 ms 4916 KB Wrong answer: output = 64, expected = 52
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4600 KB Correct answer: answer = 4
2 Correct 5 ms 4712 KB Correct answer: answer = 4
3 Correct 5 ms 4916 KB Correct answer: answer = 4
4 Correct 6 ms 4916 KB Correct answer: answer = 12
5 Incorrect 5 ms 4916 KB Wrong answer: output = 64, expected = 52
6 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4600 KB Correct answer: answer = 4
2 Correct 5 ms 4712 KB Correct answer: answer = 4
3 Correct 5 ms 4916 KB Correct answer: answer = 4
4 Correct 6 ms 4916 KB Correct answer: answer = 12
5 Incorrect 5 ms 4916 KB Wrong answer: output = 64, expected = 52
6 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4600 KB Correct answer: answer = 4
2 Correct 5 ms 4712 KB Correct answer: answer = 4
3 Correct 5 ms 4916 KB Correct answer: answer = 4
4 Correct 6 ms 4916 KB Correct answer: answer = 12
5 Incorrect 5 ms 4916 KB Wrong answer: output = 64, expected = 52
6 Halted 0 ms 0 KB -