제출 #217831

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
217831	2020-03-31 00:48:04	MohamedAhmed04	사다리꼴 (balkan11_trapezoid)	C++14	30 / 100	188 ms	21224 KiB

trapezoid

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std ;
const int mod = 30013 ;
const int MAX = 1e5 + 10 ;
struct segment_tree
{
  vector<int>v ;
  vector<long long> tree ;
  int sz ;
  bool flag ;
  void init(vector<int>v2 , bool t)
  {
    if(t == 0)
      flag = 0 ;
    else
      flag = 1 ;
    sz = (int)v2.size() ;
    v = v2 ;
    sort(v.begin() , v.end()) ;
    tree.resize(sz*4+10) ;
    for(int i = 0 ; i <= sz*4 ; ++i)
      tree[i] = 0 ;
  }
  int getidx1(long long idx)
  {
    int idx2 = lower_bound(v.begin() , v.end() , idx) - v.begin() ;
    return idx2 ;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 100