# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51767 | model_code | Employment (JOI16_employment) | C++17 | 426 ms | 9248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
class BIT{
private:
vector<int> dat;
int size;
public:
void init( int n ){
size = 1;
while( size < n ) size *= 2;
dat = vector<int>( size , 0 );
}
void add( int k , int v ){
for( int i = k+1; i <= size; i += i & -i ) dat[i-1] += v;
}
int sum( int k ){ // [ 0 , k ]
int res = 0;
for( int i = k+1; i > 0; i -= i & -i ) res += dat[i-1];
return res;
}
};
vector<int> compress( vector<int> compress_array ){
vector<int> ord = compress_array, res(0);
sort( ord.begin() , ord.end() );
ord.erase( unique( ord.begin() , ord.end() ) , ord.end() );
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |