Codeforce 438D-The Child and Sequence

D. The Child and Sequence
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite sequence of Picks.

Fortunately, Picks remembers how to repair the sequence. Initially he should create an integer array a[1], a[2], ..., a[n]. Then he should perform a sequence of m operations. An operation can be one of the following:

  1. Print operation l, r. Picks should write down the value of .
  2. Modulo operation l, r, x. Picks should perform assignment a[i] = a[imod x for each i (l ≤ i ≤ r).
  3. Set operation k, x. Picks should set the value of a[k] to x (in other words perform an assignment a[k] = x).

Can you help Picks to perform the whole sequence of operations?

Input

The first line of input contains two integer: n, m (1 ≤ n, m ≤ 105). The second line contains n integers, separated by space:a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 109) — initial value of array elements.

Each of the next m lines begins with a number type .

  • If type = 1, there will be two integers more in the line: l, r (1 ≤ l ≤ r ≤ n), which correspond the operation 1.
  • If type = 2, there will be three integers more in the line: l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 109), which correspond the operation 2.
  • If type = 3, there will be two integers more in the line: k, x (1 ≤ k ≤ n; 1 ≤ x ≤ 109), which correspond the operation 3.
Output

For each operation 1, please print a line containing the answer. Notice that the answer may exceed the 32-bit integer.

Sample test(s)
input
5 5
1 2 3 4 5
2 3 5 4
3 3 5
1 2 5
2 1 3 3
1 1 3
output
8
5
input
10 10
6 9 6 7 6 1 10 10 9 5
1 3 9
2 7 10 9
2 5 10 8
1 4 7
3 3 7
2 7 9 9
1 2 4
1 6 6
1 5 9
3 1 10
output
49
15
23
1
9
Note

Consider the first testcase:

  • At first, a = {1, 2, 3, 4, 5}.
  • After operation 1a = {1, 2, 3, 0, 1}.
  • After operation 2a = {1, 2, 5, 0, 1}.
  • At operation 32 + 5 + 0 + 1 = 8.
  • After operation 4a = {1, 2, 2, 0, 1}.
  • At operation 51 + 2 + 2 = 5.
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
struct node{
    long long l, r, s, maxx;
}num[800005];
long long n, m, key;

template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if(c=getchar(),c==EOF) return 0; //EOF
	while(c!='-'&&(c<'0'||c>'9')) c=getchar();
	sgn=(c=='-')?-1:1;
	ret=(c=='-')?0:(c-'0');
	while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
	ret*=sgn;
	return 1;
}

inline void out(long long x) {
	if(x>9) out(x/10);
	putchar(x%10+'0');
}

void build(int l,int r,int k)
{
    num[k].l = l;
    num[k].r = r;
    num[k].s = 0;
    num[k].maxx = 0;
    if(l == r)    return;
    int mi = (l+r)>>1;
    build(l,mi,k+k);
    build(mi+1,r,k+k+1);
    return;
}

void update(int l, int r, int k)
{
	if(num[k].l==num[k].r)
	{
		num[k].s = key;
		num[k].maxx = key;
		return;
	}
    int mi = (num[k].l+num[k].r)>>1;
    if(l > mi)    update(l,r,k+k+1);
    else if(r <= mi)    update(l,r,k+k);
    else
    {
        update(l,mi,k+k);
        update(mi+1,r,k+k+1);    
    }
    num[k].s = num[k+k].s + num[k+k+1].s;
    num[k].maxx = max(num[k+k].maxx,num[k+k+1].maxx);
    return;
}

void upmod(int l, int r, int k)
{
	if(num[k].maxx<key)	return;
	if(num[k].l==num[k].r)
	{
		num[k].s%=key;
		num[k].maxx = num[k].s;
		return;
	}
    int mi = (num[k].l+num[k].r)>>1;
    if(l > mi)    		upmod(l,r,k+k+1);
    else if(r <= mi)    upmod(l,r,k+k);
    else
    {
        upmod(l,mi,k+k);
        upmod(mi+1,r,k+k+1);    
    }
    num[k].s = num[k+k].s + num[k+k+1].s;
    num[k].maxx = max(num[k+k].maxx,num[k+k+1].maxx);
    return;
}

long long query(int k,int l,int r)
{
	if(num[k].l==l && num[k].r==r)
	{
	    return num[k].s;		
	}
	else
	{
		int mi = (num[k].l+num[k].r)>>1;
		if(r<=mi)		return query(k+k,l,r);
		else if(l>mi)	return query(k+k+1,l,r);
		else			return query(k+k,l,mi)+query(k+k+1,mi+1,r);
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
    int Case;
    int a, b, c;
        memset(num,0,sizeof(num));
        scan_d(n);
        scan_d(m);
        build(1,n,1);
        for(int i=1;i<=n;i++){
			scan_d(key);
            update(i,i,1);
        }
		while(m--)
		{
        	scan_d(c);
        	switch(c)
        	{
        		case 1:	
					scan_d(a);
        			scan_d(b);
        			out(query(1,a,b));
        			putchar('\n');
					break;
        		case 2:	
					scan_d(a);
					scan_d(b);
					scan_d(key);
        			upmod(a,b,1); 
        			break;
        		case 3:
        			scan_d(a);
        			scan_d(key);
        			update(a,a,1);
        			break;
        	}			
		}
    return 0;
}

另一种的线段树写法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <deque>
#include <cstring>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cstdlib>
#include <iomanip>
using namespace std;
typedef long long LL;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int maxn = 100010;

LL sum[maxn<<2], ma[maxn<<2];
void PushUP(int rt) {
    sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void PushUP2(int rt) {
    ma[rt] = max(ma[rt<<1], ma[rt<<1|1]);
}
void build(int l,int r,int rt) {
    if (l == r) {
        //scanf("%I64d",&sum[rt]);
        cin >> sum[rt];
        ma[rt] = sum[rt];
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    PushUP(rt);
    PushUP2(rt);
}
//#define lson l , m , rt << 1
//#define rson m + 1 , r , rt << 1 | 1
void MOD(int L,int R,int l,int r,int rt, LL mod)
{
   // if(R < l  || L > r) return ;
   // if(L <= l && r <= R && ma[rt] < mod) return ;
    if(ma[rt] < mod) return ;
    if(l == r) {sum[rt] %= mod; ma[rt] = sum[rt];return ;}

    int m = (l + r) >> 1;
    if (L <= m) MOD(L, R , lson, mod);
    if (R > m)  MOD(L, R , rson, mod);
    PushUP(rt);
    PushUP2(rt);
}

void update(int p,LL add,int l,int r,int rt) {
    if (l == r) {
        //sum[rt] += add;
        sum[rt] = add;
        ma[rt] = sum[rt];
        return ;
    }
    int m = (l + r) >> 1;
    if (p <= m) update(p , add , lson);
    else update(p , add , rson);
    PushUP(rt);
    PushUP2(rt);
}
LL query(int L,int R,int l,int r,int rt) {
    if (L <= l && r <= R) {
        return sum[rt];
    }
    int m = (l + r) >> 1;
    LL ret = 0;
    if (L <= m) ret += query(L , R , lson);
    if (R > m) ret += query(L , R , rson);
    return ret;
}
int main() {

    int n, m, op, l, r, k;
    LL x, mod;
    scanf("%d%d",&n,&m);
    build(1, n, 1);
    while(m--)
    {
        scanf("%d",&op);
        if(op == 1)
        {
            //scanf("%d%d",&l, &r);
            cin >> l >> r;
            cout << query(l, r, 1, n, 1) << endl;
            //printf("%I64d\n",query(l, r, 1, n, 1));
        }
        else if(op == 2)
        {
            cin >> l >> r >> mod;
            //scanf("%d%d%I64d",&l, &r, &mod);
            MOD(l, r, 1, n, 1, mod);

        }
        else
        {
            cin >> k >> x;
            //scanf("%d%d",&k,&x);
            update(k, x, 1, n, 1);
        }
    }

    return 0;
}


### 回答1: #include <stdio.h> int main(){ //定义一个3*3的数组用来存储棋盘 int board[3][3]={0}; int x,y,turn=1; while (1){ //打印棋盘 printf("当前棋盘:\n"); for (x=0;x<3;x++){ for (y=0;y<3;y++){ printf("%d ",board[x][y]); } printf("\n"); } //根据turn的值来判断谁轮到落子 if (turn==1){ printf("轮到X落子,请输入落子的位置(x y):"); }else { printf("轮到O落子,请输入落子的位置(x y):"); } scanf("%d %d",&x,&y); //将落子位置的值设置为对应的值 board[x][y] = turn; //改变轮到谁落子 turn = -turn; //判断谁赢了 if (board[0][0]==board[1][1] && board[1][1]==board[2][2] && board[2][2]!=0){ printf("游戏结束,获胜者是%c\n",board[0][0]==1?'X':'O'); break; } if (board[2][0]==board[1][1] && board[1][1]==board[0][2] && board[0][2]!=0){ printf("游戏结束,获胜者是%c\n",board[2][0]==1?'X':'O'); break; } for (x=0;x<3;x++){ if (board[x][0]==board[x][1] && board[x][1]==board[x][2] && board[x][2]!=0){ printf("游戏结束,获胜者是%c\n", board[x][0] == 1 ? 'X' : 'O'); break; } if (board[0][x]==board[1][x] && board[1][x]==board[2][x] && board[2][x]!=0){ printf("游戏结束,获胜者是%c\n", board[0][x] == 1 ? 'X' : 'O'); break; } } } return 0; } ### 回答2: 为了回答这个问题,需要提供题目的具体要求和规则。由于提供的信息不够具体,无法为您提供准确的代码。但是,我可以给您一个简单的Tic-tac-toe游戏的示例代码,供您参考: ```c #include <stdio.h> #include <stdbool.h> // 判断游戏是否结束 bool isGameOver(char board[][3]) { // 判断每行是否有3个相同的棋子 for(int i = 0; i < 3; i++) { if(board[i][0] != '.' && board[i][0] == board[i][1] && board[i][0] == board[i][2]) { return true; } } // 判断每列是否有3个相同的棋子 for(int i = 0; i < 3; i++) { if(board[0][i] != '.' && board[0][i] == board[1][i] && board[0][i] == board[2][i]) { return true; } } // 判断对角线是否有3个相同的棋子 if(board[0][0] != '.' && board[0][0] == board[1][1] && board[0][0] == board[2][2]) { return true; } if(board[0][2] != '.' && board[0][2] == board[1][1] && board[0][2] == board[2][0]) { return true; } return false; } // 输出棋盘 void printBoard(char board[][3]) { for(int i = 0; i < 3; i++) { for(int j = 0; j < 3; j++) { printf("%c ", board[i][j]); } printf("\n"); } } int main() { char board[3][3]; // 初始化棋盘 for(int i = 0; i < 3; i++) { for(int j = 0; j < 3; j++) { board[i][j] = '.'; } } int player = 1; // 玩家1先下 int row, col; while(true) { printf("Player %d's turn:\n", player); printf("Row: "); scanf("%d", &row); printf("Column: "); scanf("%d", &col); // 判断输入是否合法 if(row < 0 || row >= 3 || col < 0 || col >= 3 || board[row][col] != '.') { printf("Invalid move. Try again.\n"); continue; } // 下棋 board[row][col] = (player == 1) ? 'X' : 'O'; // 输出棋盘 printBoard(board); // 判断游戏是否结束 if(isGameOver(board)) { printf("Player %d wins!\n", player); break; } // 切换玩家 player = (player == 1) ? 2 : 1; } return 0; } ``` 这段代码实现了一个简单的命令行下的Tic-tac-toe游戏。玩家1使用'X'棋子,玩家2使用'O'棋子。玩家依次输入行和列,下棋后更新棋盘,并判断游戏是否结束。当游戏结束时,会输出获胜者并结束游戏。 ### 回答3: 题目要求实现一个井字棋游戏的判断胜负函数。给定一个3x3的井字棋棋盘,用C语言编写一个函数,判断当前是否存在某个玩家获胜或者平局。 题目要求代码中定义一个3x3的字符数组board来表示棋盘,其中 'X' 表示玩家1在该位置放置了一个棋子, 'O' 表示玩家2在该位置放置了一个棋子, '.' 表示该位置没有棋子。 下面是实现此题的C语言代码: ```c #include <stdio.h> #include <stdbool.h> // 用于使用bool类型 bool checkWin(char board[3][3]) { // 检查每一行是否有获胜的情况 for (int row = 0; row < 3; row++) { if (board[row][0] == board[row][1] && board[row][1] == board[row][2] && board[row][0] != '.') { return true; } } // 检查每一列是否有获胜的情况 for (int col = 0; col < 3; col++) { if (board[0][col] == board[1][col] && board[1][col] == board[2][col] && board[0][col] != '.') { return true; } } // 检查对角线是否有获胜的情况 if ((board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] != '.') || (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][2] != '.')) { return true; } return false; // 没有获胜的情况 } int main() { char board[3][3]; // 存储棋盘状态 // 读取棋盘状态 for (int i = 0; i < 3; i++) { scanf("%s", board[i]); } // 调用检查胜负的函数,并输出结果 if (checkWin(board)) { printf("YES\n"); } else { printf("NO\n"); } return 0; } ``` 这个程序中定义了一个函数checkWin,用于检查是否有玩家获胜。遍历棋盘的每一行、每一列和对角线,判断是否有连续相同的字符且不为'.',如果有,则返回true;否则返回false。 在主函数main中,首先定义一个3x3的字符数组board,然后通过循环从标准输入中读取棋盘状态。接着调用checkWin函数进行胜负判断,并根据结果输出"YES"或者"NO"。最后返回0表示程序正常结束。 请注意,该代码只包含了检查胜负的功能,并没有包含其他如用户输入、判断平局等功能。如果需要完整的游戏代码,请告知具体要求。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值