oj.uz

Submission #157204

# Submission time Handle Problem Language Result Execution time Memory
157204 2019-10-10T04:22:41 Z EntityIT 별자리 2 (JOI14_constellation2) C++14
100 / 100
 1963 ms 604 KB 
#include<bits/stdc++.h>

using namespace std;

using LL = long long;
const int NStar = (int)3e3 + 5;

int nStar;
LL ans;
vector<int> num(3, 0);

struct Star {
    int x, y, c;
    Star(int _x = 0, int _y = 0, int _c = 0) : x(_x), y(_y), c(_c) {}
    Star operator-(const Star &_) const { return Star(x - _.x, y - _.y, c); }
    Star operator+(const Star &_) const { return Star(x + _.x, y + _.y, c); }
    LL operator^(const Star &_) const { return (LL)x * _.y - (LL)y * _.x; }
    bool operator<(const Star &_) const {
        auto up = [&](Star a) { return a.y > 0 || (!a.y && a.x > 0); };
        if (up(*this) != up(_) ) return up(*this) > up(_);
        else return (*this ^ _) > 0;
    }
    void print() { cerr << x << ' ' << y << ' ' << c << '\n'; }
} initStar[NStar];

int main() {
//    freopen("input", "r", stdin);

    scanf(" %d", &nStar);
    for (int i = 1; i <= nStar; ++i) {
        scanf(" %d %d %d", &initStar[i].x, &initStar[i].y, &initStar[i].c);
        ++num[ initStar[i].c ];
    }

    for (int origin = 1; origin <= nStar; ++origin) {
//        initStar[origin].print();
        vector<Star> star;
        for (int i = 1; i <= nStar; ++i) if (i != origin) {
            star.push_back(initStar[i] - initStar[origin]);
        }
        sort(star.begin(), star.end() );
//        for (auto aStar : star) (aStar + initStar[origin]).print(); cerr << '\n';

        vector<int> cnt(3, 0);
        auto nxt = [&](int _i, int _n) { return _i == _n - 1 ? 0 : _i + 1; };

        for (int i = 0, j = 0; i < (int)star.size(); ++i) {
            --cnt[ star[i].c ];
            if (i == j) {
                ++cnt[ star[j].c ];
                j = nxt(j, (int)star.size() );
            }
            while (j != i && (star[i] ^ star[j]) > 0) {
                ++cnt[ star[j].c ];
                j = nxt(j, (int)star.size() );
            }
            vector<int> L = cnt, R(3, 0);
            for (int c = 0; c < 3; ++c) R[c] = num[c] - cnt[c];
            --R[ initStar[origin].c ]; --R[ star[i].c ];
            LL ret = 1;
            for (int c = 0; c < 3; ++c) if (c != star[i].c) ret *= L[c];
            for (int c = 0; c < 3; ++c) if (c != initStar[origin].c) ret *= R[c];
//            cerr << i << ' ' << j << "  ==  ";
//            for (int c = 0; c < 3; ++c) cerr << L[c] << ' ';
//            for (int c = 0; c < 3; ++c) cerr << R[c] << ' '; cerr << '\n';
            ans += ret;
        }
//        cerr << "ans = " << ans << '\n';
    }

    cout << ans / 2;

    return 0;
}

Compilation message

constellation2.cpp: In function 'int main()':
constellation2.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %d", &nStar);
     ~~~~~^~~~~~~~~~~~~~~
constellation2.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %d %d %d", &initStar[i].x, &initStar[i].y, &initStar[i].c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 19 ms 504 KB Output is correct
7 Correct 19 ms 380 KB Output is correct
8 Correct 19 ms 376 KB Output is correct
9 Correct 19 ms 376 KB Output is correct
10 Correct 14 ms 376 KB Output is correct
11 Correct 19 ms 376 KB Output is correct
12 Correct 19 ms 376 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 444 KB Output is correct
2 Correct 158 ms 376 KB Output is correct
3 Correct 205 ms 376 KB Output is correct
4 Correct 305 ms 412 KB Output is correct
5 Correct 490 ms 468 KB Output is correct
6 Correct 798 ms 504 KB Output is correct
7 Correct 1361 ms 468 KB Output is correct
8 Correct 1862 ms 604 KB Output is correct
9 Correct 1935 ms 472 KB Output is correct
10 Correct 1910 ms 504 KB Output is correct
11 Correct 1963 ms 476 KB Output is correct
12 Correct 1819 ms 480 KB Output is correct
13 Correct 1897 ms 472 KB Output is correct
14 Correct 1950 ms 504 KB Output is correct
15 Correct 1926 ms 604 KB Output is correct
16 Correct 1856 ms 476 KB Output is correct