oj.uz

답안 #474301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474301 2021-09-17T20:41:18 Z Carmel_Ab1 Mountains (IOI17_mountains) C++17
20 / 100
 166 ms 312 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}

#include "mountains.h"
//#include "grader.cpp"

vvi g;
vi col;

vector<bool>vis;
void dfs(int src){
    vis[src]=1;


    for(int nbr:g[src])
        if(!vis[nbr])
            dfs(nbr);

    map<int,bool>has;
    for(int nbr:g[src])
        has[col[nbr]]=1;

    for(int i=1; ; i++){
        if(!has[i]){
            col[src]=i;
            return;
        }
    }
}
int maximum_deevs(vi Y) {
    int n=Y.size();

    vl y(n);
    for(int i=0; i<n; i++)
        y[i]=ll(Y[i]);
    g.resize(n);
    vector<vector<bool>>has(n,vector<bool>(n));
    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            bool ok=1;
            for(int k=i+1; k<j; k++) {
                if ((y[k]-y[i])*(i-j)<(y[i]-y[j])*(k-i))
                    ok=0;
            }
            if(!ok)
                continue;
            g[i].pb(j),g[j].pb(i);
            has[i][j]=has[j][i]=1;
        }
    }

    int ans=0;
    for(int i=0; i<(1<<n); i++){
        vi cur;
        for(int j=0; j<n; j++)
            if(i&(1<<j))
                cur.pb(j);
        bool ok=1;
        for(int j1=0;ok && j1<cur.size(); j1++)
            for(int j2=j1+1;ok && j2<cur.size(); j2++)
                if(has[cur[j1]][cur[j2]])
                    ok=0;

        if(ok)
            ans=max(ans,__builtin_popcount(i));
    }
    return ans;
    col.resize(n);
    vis.resize(n);

    dfs(0);
    map<int,int>cnt;
    for(int i=0; i<n; i++){
        cnt[col[i]]++;
        ans=max(ans,cnt[col[i]]);
    }
    return ans;
}

Compilation message

mountains.cpp: In function 'int maximum_deevs(vi)':
mountains.cpp:187:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |         for(int j1=0;ok && j1<cur.size(); j1++)
      |                            ~~^~~~~~~~~~~
mountains.cpp:188:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  188 |             for(int j2=j1+1;ok && j2<cur.size(); j2++)
      |                                   ~~^~~~~~~~~~~
mountains.cpp: In function 'void usaco(std::string)':
mountains.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
mountains.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 133 ms 272 KB Output is correct
7 Correct 129 ms 204 KB Output is correct
8 Correct 134 ms 312 KB Output is correct
9 Correct 148 ms 272 KB Output is correct
10 Correct 63 ms 204 KB Output is correct
11 Correct 166 ms 276 KB Output is correct
12 Correct 127 ms 276 KB Output is correct
13 Correct 129 ms 276 KB Output is correct
14 Correct 154 ms 292 KB Output is correct
15 Correct 132 ms 276 KB Output is correct
16 Correct 133 ms 204 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 133 ms 272 KB Output is correct
7 Correct 129 ms 204 KB Output is correct
8 Correct 134 ms 312 KB Output is correct
9 Correct 148 ms 272 KB Output is correct
10 Correct 63 ms 204 KB Output is correct
11 Correct 166 ms 276 KB Output is correct
12 Correct 127 ms 276 KB Output is correct
13 Correct 129 ms 276 KB Output is correct
14 Correct 154 ms 292 KB Output is correct
15 Correct 132 ms 276 KB Output is correct
16 Correct 133 ms 204 KB Output is correct
17 Incorrect 1 ms 204 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 133 ms 272 KB Output is correct
7 Correct 129 ms 204 KB Output is correct
8 Correct 134 ms 312 KB Output is correct
9 Correct 148 ms 272 KB Output is correct
10 Correct 63 ms 204 KB Output is correct
11 Correct 166 ms 276 KB Output is correct
12 Correct 127 ms 276 KB Output is correct
13 Correct 129 ms 276 KB Output is correct
14 Correct 154 ms 292 KB Output is correct
15 Correct 132 ms 276 KB Output is correct
16 Correct 133 ms 204 KB Output is correct
17 Incorrect 1 ms 204 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 133 ms 272 KB Output is correct
7 Correct 129 ms 204 KB Output is correct
8 Correct 134 ms 312 KB Output is correct
9 Correct 148 ms 272 KB Output is correct
10 Correct 63 ms 204 KB Output is correct
11 Correct 166 ms 276 KB Output is correct
12 Correct 127 ms 276 KB Output is correct
13 Correct 129 ms 276 KB Output is correct
14 Correct 154 ms 292 KB Output is correct
15 Correct 132 ms 276 KB Output is correct
16 Correct 133 ms 204 KB Output is correct
17 Incorrect 1 ms 204 KB Output isn't correct
18 Halted 0 ms 0 KB -