Cod sursa(job #2820994)

Utilizator mamaierooAdrian Necula mamaieroo Data 21 decembrie 2021 22:39:15
Problema Hashuri Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.49 kb
#include <iostream>
#include <vector>
#include <time.h>
#include <stdio.h>
#include <chrono>
#include <fstream>

//#include "utilFunc.h"

using namespace std;

class Time {
    time_t timer;
    bool years;
    bool months;
    bool days;
    bool hours;
    bool minutes;
    bool seconds;
    bool miliseconds;

    time_t time(time_t* timer);

    void PrintTime();

};





int64_t Search (int64_t n, vector<vector<int64_t>>& x){
    int p = x.size();
    for (int i = 0; i < x[n % p].size(); i ++) {
        if (x[n % p][i] == n)
            return i;
    }
    return -1;
}

void Add(int64_t n, vector<vector<int64_t>>& x) {
    int p = x.size();
    if (Search(n, x) == -1) {
        x[n % p].push_back(n);
    }
}

void Remove(int64_t n, vector<vector<int64_t>>& x) {
    int p = x.size();
    int i = Search(n, x);
    if (i != -1) {
        x[n % p].erase(x[n % p].begin()+ i);
    }
}



int main() {
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    int64_t nroperatii, alegeoperatia, n, p;
    vector<vector<int64_t>> x;
    x.resize(100000);
    p = 100000;
    fin >> nroperatii;
    for (int i = 0; i < nroperatii; i++) {
        fin >> alegeoperatia >> n;

        if (alegeoperatia == 1) {
            Add(n, x);
        }
        else if (alegeoperatia == 2) {
            Remove(n, x);
        }
        else if (alegeoperatia == 3) {
            fout << (Search(n, x) != -1);
        }
    }

    
}