比赛的时候直接套模板。。。。
有个地方忘记改了WA了半天
T_T没办法,谁让我蒟蒻。。。。
AC代码如下:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 110000
const int MAX_F = 91;
__int64 f[100];
int N, M;
__int64 sum[8*MAX];
bool mark[8*MAX];
void init(){
f[0] = 1;
f[1] = 1;
for( int i = 2; i <= MAX_F; i++ ){
f[i] = f[i-1] + f[i-2];
}
}
__int64 get_num( __int64 x ){
__int64 ans;
if( x <= f[0] ){
return f[0];
}
if( x >= f[MAX_F] ){
return f[MAX_F];
}
for( int i = 0; i < MAX_F; i++ ){
if( x >= f[i] && x <= f[i+1] ){
if( x - f[i] <= f[i+1] - x ){
ans = f[i];
return ans;
}else{
ans = f[i+1];
return ans;
}
}
}
return f[MAX_F];
}
void PushUp( int rt ){
sum[rt] = sum[rt*2] + sum[rt*2+1];
mark[rt] = mark[rt*2] && mark[rt*2+1];
}
void Add( int id, __int64 num, int L, int R, int rt ){
if( L == R ){
sum[rt] += num;
mark[rt] = false;
return;
}
int mid = ( L + R ) >> 1;
if( id <= mid ) Add( id, num, L, mid, rt * 2 );
else Add( id, num, mid + 1, R, rt * 2 + 1 );
PushUp( rt );
}
void updat_f( int l, int r, int L, int R, int rt ){
if( L == R ){
sum[rt] = get_num( sum[rt] );
mark[rt] = true;
return;
}
int mid = ( L + R ) >> 1;
if( l <= mid && !mark[rt*2] ) updat_f( l, r, L, mid, rt * 2 );
if( r > mid && !mark[rt*2+1] ) updat_f( l, r, mid + 1, R, rt * 2 + 1 );
PushUp( rt );
}
__int64 query( int l, int r, int L, int R, int rt ){
if( l <= L && r >= R ){
return sum[rt];
}
int mid = ( L + R ) >> 1;
__int64 ans = 0;
if( l <= mid ) ans += query( l, r, L, mid, rt * 2 );
if( r > mid ) ans += query( l, r, mid + 1, R, rt * 2 + 1 );
return ans;
}
int main(){
init();
while( scanf( "%d%d", &N, &M ) != EOF ){
memset( sum, 0, sizeof( sum ) );
memset( mark, false, sizeof( mark ) );
for( int i = 0; i < M; i++ ){
int temp1, temp2;
__int64 temp3;
scanf( "%d%d%I64d", &temp1, &temp2, &temp3 );
if( temp1 == 1 ){
Add( temp2, temp3, 1, N, 1 );
}else if( temp1 == 2 ){
__int64 ans = query( temp2, temp3, 1, N, 1 );
printf( "%I64d\n", ans );
}else{
updat_f( temp2, temp3, 1, N, 1 );
}
}
}
return 0;
}