传送门
1.模拟
easy
#include <cstdio> #define N 500001 int n, m; int X[N], Y[N], x[N], y[N], a = 1, b = 1, p, q; char s[N][1]; int main() for(i = m; i >= 1; i) if(s[i][0] == 'm') else if(s[i][0] == 'x') else for(i = 1; i <= n; i++) printf("%d %d\n", X[i] * a + p, Y[i] * b + q); return 0; }
2.矩阵优化
详见 Matrix67
#include <cstdio> #include <cstring> #define N 500001 int n, m; int X[N], Y[N], x[N], y[N]; char s[N][2]; struct Matrix }sum; inline Matrix operator * (const Matrix x, const Matrix y) int main() for(i = m; i >= 1; i) for(i = 1; i <= n; i++) return 0; }
上一篇：[luoguP2447] [SDOI2010]外星千足虫（高斯消元 + bitset）
下一篇：[luoguP2948] [USACO09OPEN]滑雪课Ski Lessons（DP）
模拟 矩阵
