oj.uz

답안 #743638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743638 2023-05-17T15:01:54 Z Filya Izbori (COCI22_izbori) C++14
10 / 110
 763 ms 7840 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int a[200005], pref[200005], cnt[200005], sq = 440;
vi ma[200005];

int main() {
    fastio;
    int n; cin >> n; fra(n)
    vi comp; fri(n) comp.pb(a[i]);
    sort(all(comp)); uniq(comp);
    fri(n) {
        a[i] = lb(all(comp), a[i]) - comp.begin();
        ma[a[i]].pb(i);
    }
    ll ans = n;
    //max hajordakan sq hat => mijakayqy 2sq erkarutyan lini => amen mijakayq nayenq dra keterov sksox =>n armat logn
    fri(n) { //amen mijakayqy 2sq hatov gnanq
        cnt[a[i]]++; 
        int maxi=a[i];
        int lim = min(n, i+2*sq+1);
        frrj(i + 1, lim) {
            cnt[a[j]]++;
            if(cnt[a[j]] > cnt[maxi]) maxi = a[j];
            if(cnt[maxi] > (j-i+1)/2 && (ma[maxi].size() <= sq))
                ans++;
        }
        cnt[a[i]] = 0; frrj(i + 1, lim) cnt[a[j]] = 0;
    }
    frp(comp.size()) { //n/sqrtn 
        if((int)(ma[p].size()) <= sq) continue;
        // (it.ss).size() > sq => max sq hat ka senc
        int x = p;
        fri(n) {
            pref[i+1] = pref[i];
            if(a[i] == x) pref[i+1]++;
            else pref[i+1]--;
        }
        int cur = 0;
        frr(1, 1 + n) { //iranic < tveri qanaky gumarenq
            cnt[pref[i-1]]++;
            if(pref[i] > pref[i-1]) 
                cur += cnt[pref[i-1]];
            else cur -= cnt[pref[i]];
            ans += cur;
        }
        frr(1, 1 + n) cnt[pref[i-1]] = 0;
    }
    cout << ans;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will


/*


    // frp(comp.size()) {
    //     if((int)(ma[p].size()) > sq) continue;
    //     //max hajordakan sq hat => mijakayqy 2sq erkarutyan lini => amen mijakayq nayenq dra keterov sksox =>n armat logn
    //     ans += ma[p].size();
    //     fri(n) {
    //         cnt[a[i]]++; 
    //         int lim = min(n, i+2*(int)(ma[p].size())+1);
    //         frrj(i + 1, lim) {
    //             cnt[a[j]]++;
    //             if(cnt[p] > (j-i+1)/2) ans++;
    //         }
    //         cnt[a[i]] = 0; frrj(i + 1, lim) cnt[a[j]] = 0;
    //     }
    // }
    
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:109:58: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  109 |             if(cnt[maxi] > (j-i+1)/2 && (ma[maxi].size() <= sq))
      |                                          ~~~~~~~~~~~~~~~~^~~~~
Main.cpp:57:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 | #define frp(x) for(int p = 0; p < x; ++p)
      |                               ~~^~~~~~~~~
   58 | #define frr(a, b) for(int i = a; i < b; ++i)
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   59 | #define frrj(a, b) for(int j = a; j < b; ++j)
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   60 | #define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   61 | #define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   62 | #define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   63 | #define fr(x) for(auto it : x) //el
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 | #define fastio ios_base::sync_with_stdio(false); cin.tie(0);
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 | #define dbg(x) cerr << #x << ": " << x << endl;
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   66 | #define ce(x) cout << x << endl;
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
   67 | #define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   68 | #define blt __builtin_popcount
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~   
   69 | /////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 | void print(long long t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 | void print(int t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~   
   72 | void print(string t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 | void print(char t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
   74 | void print(double t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   75 | void print(long double t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   76 | void print(unsigned long long t) {cerr << t;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   77 | template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   78 | template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 | template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   80 | template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   81 | template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 | template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   83 | template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   84 | template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   85 | template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   86 | template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   87 | /////////////////////code/////////////////////
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   88 | int a[200005], pref[200005], cnt[200005], sq = 440;
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   89 | vi ma[200005];
      | ~~~~~~~~~~~~~~                   
   90 | 
      |                                  
   91 | int main() {
      | ~~~~~~~~~~~~                     
   92 |     fastio;
      |     ~~~~~~~                      
   93 |     int n; cin >> n; fra(n)
      |     ~~~~~~~~~~~~~~~~~~~~~~~      
   94 |     vi comp; fri(n) comp.pb(a[i]);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   95 |     sort(all(comp)); uniq(comp);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
   96 |     fri(n) {
      |     ~~~~~~~~                     
   97 |         a[i] = lb(all(comp), a[i]) - comp.begin();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |         ma[a[i]].pb(i);
      |         ~~~~~~~~~~~~~~~          
   99 |     }
      |     ~                            
  100 |     ll ans = n;
      |     ~~~~~~~~~~~                  
  101 |     //max hajordakan sq hat => mijakayqy 2sq erkarutyan lini => amen mijakayq nayenq dra keterov sksox =>n armat logn
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |     fri(n) { //amen mijakayqy 2sq hatov gnanq
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |         cnt[a[i]]++;
      |         ~~~~~~~~~~~~             
  104 |         int maxi=a[i];
      |         ~~~~~~~~~~~~~~           
  105 |         int lim = min(n, i+2*sq+1);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |         frrj(i + 1, lim) {
      |         ~~~~~~~~~~~~~~~~~~       
  107 |             cnt[a[j]]++;
      |             ~~~~~~~~~~~~         
  108 |             if(cnt[a[j]] > cnt[maxi]) maxi = a[j];
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  109 |             if(cnt[maxi] > (j-i+1)/2 && (ma[maxi].size() <= sq))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  110 |                 ans++;
      |                 ~~~~~~           
  111 |         }
      |         ~                        
  112 |         cnt[a[i]] = 0; frrj(i + 1, lim) cnt[a[j]] = 0;
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  113 |     }
      |     ~                            
  114 |     frp(comp.size()) { //n/sqrtn
      |     ~~~~~~~~~~~~~~~              
Main.cpp:114:5: note: in expansion of macro 'frp'
  114 |     frp(comp.size()) { //n/sqrtn
      |     ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5032 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5032 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 6 ms 5040 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct
9 Correct 12 ms 5076 KB Output is correct
10 Correct 11 ms 5076 KB Output is correct
11 Correct 12 ms 5076 KB Output is correct
12 Correct 12 ms 5088 KB Output is correct
13 Correct 12 ms 5088 KB Output is correct
14 Correct 12 ms 5040 KB Output is correct
15 Correct 12 ms 5096 KB Output is correct
16 Correct 12 ms 5076 KB Output is correct
17 Incorrect 12 ms 5076 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 763 ms 7840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5032 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 6 ms 5040 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct
9 Correct 12 ms 5076 KB Output is correct
10 Correct 11 ms 5076 KB Output is correct
11 Correct 12 ms 5076 KB Output is correct
12 Correct 12 ms 5088 KB Output is correct
13 Correct 12 ms 5088 KB Output is correct
14 Correct 12 ms 5040 KB Output is correct
15 Correct 12 ms 5096 KB Output is correct
16 Correct 12 ms 5076 KB Output is correct
17 Incorrect 12 ms 5076 KB Output isn't correct
18 Halted 0 ms 0 KB -