Codeforces 232E - Quick Tortoise bitset+分治
题意:
思路:
//By SiriusRen
#include <cstdio>
#include <bitset>
#include <vector>
using namespace std;
int n,m,q;
char map[505][505],ans[600005];
struct Node{int x1,y1,x2,y2,id;}jy;
vector<Node>vec;
b
原创
2017-01-26 22:08:28 ·
433 阅读 ·
0 评论