Submission #73705499

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

class SegmentTree {
private:
    vector<ll> tree;
    int size;
    
public:
    SegmentTree(int n) {
        size = n;
        tree.resize(4 * n, 0);
    }
    
    void update(int node, int left, int right, int pos, ll val) {
        if (left == right) {
            tree[node] = val;
            return;
        }
        int mid = (left + right) / 2;
        if (pos <= mid) {
            update(node * 2, left, mid, pos, val);
        } else {
            update(node * 2 + 1, mid + 1, right, pos, val);
        }
        tree[node] = tree[node * 2] + tree[node * 2 + 1];
    }
    
    ll query(int node, int left, int right, int ql, int qr) {
        if (ql > right || qr < left) return 0;
        if (ql <= left && right <= qr) return tree[node];
        int mid = (left + right) / 2;
        return query(node * 2, left, mid, ql, qr) + query(node * 2 + 1, mid + 1, right, ql, qr);
    }
};

int main() {
    string s;
    cin >> s;
    
    map<char, int> freqMap;
    set<char> uniqueChars;
    vector<int> positions[26];
    
    for (int i = 0; i < s.length(); i++) {
        freqMap[s[i]]++;
        uniqueChars.insert(s[i]);
        positions[s[i] - 'a'].push_back(i);
    }
    
    vector<ll> nums(s.length());
    for (int i = 0; i < s.length(); i++) {
        nums[i] = s[i] - 'a' + 1;
    }
    
    SegmentTree segTree(s.length());
    for (int i = 0; i < s.length(); i++) {
        segTree.update(1, 0, s.length() - 1, i, nums[i]);
    }
    
    ll totalSum = segTree.query(1, 0, s.length() - 1, 0, s.length() - 1);
    
    vector<int> cnt(26, 0);
    for (char c : s) {
        cnt[c - 'a']++;
    }
    
    int mx = 0;
    for (int i = 0; i < 26; i++) {
        mx = max(mx, cnt[i]);
        if (cnt[i] > 0) {
            segTree.update(1, 0, s.length() - 1, positions[i][0], cnt[i]);
        }
    }
    
    map<int, int> countByFreq;
    for (int i = 0; i < 26; i++) {
        if (cnt[i] > 0) {
            countByFreq[cnt[i]]++;
        }
    }
    
    set<char> charsToRemove;
    for (int i = 0; i < 26; i++) {
        if (cnt[i] == mx) {
            charsToRemove.insert('a' + i);
        }
    }
    
    vector<char> result;
    for (char c : s) {
        if (cnt[c - 'a'] != mx) {
            result.push_back(c);
        }
    }
    
    for (int i = 0; i < result.size(); i++) {
        cout << result[i];
    }
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 0; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~
./Main.cpp:53:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for (int i = 0; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~
./Main.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~
./Main.cpp:98:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for (int i = 0; i < result.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
./Main.cpp:62:8: warning: unused variable 'totalSum' [-Wunused-variable]
   62 |     ll totalSum = segTree.query(1, 0, s.length() - 1, 0, s.length() - 1);
      |        ^~~~~~~~

Judge Result