CodeForces 221(div 2)

无trick水题。。。

 /*

  * Author:  Plumrain

  * Created Time:  2013-12-24 22:26

  * File Name: B.cpp

  */

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <algorithm>

 #include <vector>

 #include <cstdlib>

 #include <sstream>

 #include <fstream>

 #include <list>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <map>

 #include <set>

 #include <bitset>

 #include <cctype>

 #include <ctime>

 #include <utility>

 using namespace std;

 #define clr0(x) memset(x, 0, sizeof(x))

 #define clr1(x) memset(x, -1, sizeof(x))

 #define pb push_back

 #define sz(v) ((int)(v).size())

 #define all(t) t.begin(),t.end()

 #define INF 999999999999999999

 #define zero(x) (((x)>0?(x):-(x))<eps)

 #define out(x) cout<<#x<<":"<<(x)<<endl

 #define tst(a) cout<<a<<" "

 #define tst1(a) cout<<#a<<endl

 #define CINBEQUICKER std::ios::sync_with_stdio(false)

 const double eps = 1e-;

 const double PI = atan(1.0)*;

 const int inf =  / ;

 typedef vector<int> vi;

 typedef vector<string> vs;

 typedef vector<double> vd;

 typedef pair<int, int> pii;

 typedef long long int64;

 inline int Mymod (int a, int b) {int x=a%b; if(x<) x+=b; return x;}

 int ru[], chu[];

 int main()

 {

 //    freopen("a.in","r",stdin);

 //    freopen("a.out","w",stdout);

 //    std::ios::sync_with_stdio(false);

     int n, m;

     while (scanf ("%d%d", &n , &m) != EOF){

         int t1, t2, w;

         clr0 (chu); clr0 (ru);

         for (int i = ; i < m; ++ i){

             scanf ("%d%d%d", &t1, &t2, &w);

             chu[--t1] += w;

             ru[--t2] += w;

         }

         int ans = ;

         for (int i = ; i < n; ++ i)

             ans += abs(chu[i] - ru[i]);

         printf ("%d\n", ans / );

     }

     return ;

 }

YY题。。。结论直接看代码就好了。。。比赛的时候YY出了结论算样例算错了，然后就去想别的方法了。。。。。。

 /*

  * Author:  Plumrain

  * Created Time:  2013-12-24 22:26

  * File Name: B.cpp

  */

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <algorithm>

 #include <vector>

 #include <cstdlib>

 #include <sstream>

 #include <fstream>

 #include <list>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <map>

 #include <set>

 #include <bitset>

 #include <cctype>

 #include <ctime>

 #include <utility>

 using namespace std;

 #define clr0(x) memset(x, 0, sizeof(x))

 #define clr1(x) memset(x, -1, sizeof(x))

 #define pb push_back

 #define sz(v) ((int)(v).size())

 #define all(t) t.begin(),t.end()

 #define INF 999999999999999999

 #define zero(x) (((x)>0?(x):-(x))<eps)

 #define out(x) cout<<#x<<":"<<(x)<<endl

 #define tst(a) cout<<a<<" "

 #define tst1(a) cout<<#a<<endl

 #define CINBEQUICKER std::ios::sync_with_stdio(false)

 const double eps = 1e-;

 const double PI = atan(1.0)*;

 const int inf =  / ;

 typedef vector<int> vi;

 typedef vector<string> vs;

 typedef vector<double> vd;

 typedef pair<int, int> pii;

 typedef long long int64;

 inline int Mymod (int a, int b) {int x=a%b; if(x<) x+=b; return x;}

 int ru[], chu[];

 int main()

 {

 //    freopen("a.in","r",stdin);

 //    freopen("a.out","w",stdout);

 //    std::ios::sync_with_stdio(false);

     int n, m;

     while (scanf ("%d%d", &n , &m) != EOF){

         int t1, t2, w;

         clr0 (chu); clr0 (ru);

         for (int i = ; i < m; ++ i){

             scanf ("%d%d%d", &t1, &t2, &w);

             chu[--t1] += w;

             ru[--t2] += w;

         }

         int ans = ;

         for (int i = ; i < n; ++ i)

             ans += abs(chu[i] - ru[i]);

         printf ("%d\n", ans / );

     }

     return ;

 }

题意：给一个很大的数m，这个数的各个位上的数字中一定含有至少1个1,6,8,9。你可以重新组织所有数字的顺序，使得重新排列之后的数能被7整除。10^4 <= m <= 10^(10^6)。

　　　注意，排列之后的数不能含有前导0。

解法：把1,6,8,9四个数字放在最后面，根据前面的数*10000除以7的余数，来决定1,6,8,9四个数字的排列顺序即可。至于有没有前导0，特殊处理一下即可。

tag:math, think

 /*

  * Author:  Plumrain

  * Created Time:  2013-12-25 14:09

  * File Name: C.cpp

  */

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <algorithm>

 #include <vector>

 #include <cstdlib>

 #include <sstream>

 #include <fstream>

 #include <list>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <map>

 #include <set>

 #include <bitset>

 #include <cctype>

 #include <ctime>

 #include <utility>

 using namespace std;

 #define clr0(x) memset(x, 0, sizeof(x))

 #define clr1(x) memset(x, -1, sizeof(x))

 #define pb push_back

 #define sz(v) ((int)(v).size())

 #define all(t) t.begin(),t.end()

 #define INF 999999999999999999

 #define zero(x) (((x)>0?(x):-(x))<eps)

 #define out(x) cout<<#x<<":"<<(x)<<endl

 #define tst(a) cout<<a<<" "

 #define tst1(a) cout<<#a<<endl

 #define CINBEQUICKER std::ios::sync_with_stdio(false)

 const double eps = 1e-;

 const double PI = atan(1.0)*;

 const int inf =  / ;

 typedef vector<int> vi;

 typedef vector<string> vs;

 typedef vector<double> vd;

 typedef pair<int, int> pii;

 typedef long long int64;

 inline int Mymod (int a, int b) {int x=a%b; if(x<) x+=b; return x;}

 bool del[];

 string temp = "";

 map<int, string> mp;

 void gao(string s)

 {

     stringstream stm(s);

     int num; stm >> num;

     int yu = num % ;

     if (!mp.count(yu)) mp[yu] = s;

 }

 int main()

 {

 //    freopen("a.in","r",stdin);

 //    freopen("a.out","w",stdout);

 //    std::ios::sync_with_stdio(false);

     mp.clear();

     string tt = "";

     gao(tt);

     while (next_permutation(tt.begin(), tt.end())) gao(tt);

     string s;

     while (cin >> s){

         clr0 (del);

         string ss; ss.clear();

         int n = sz(s), cnt = ;

         for (int i = ; i < n; ++ i){

             if (s[i] == ''){

                 ++ cnt; continue;

             }

             bool ok = ;

             for (int j = ; j < ; ++ j) if (s[i] == temp[j] && !del[j]){

                 del[j] = ; ok = ;

             }

             if (!ok) ss.pb (s[i]);

         }

         int len = sz(ss);

         if (!len){

             ss = mp[];

             for (int i = ; i < cnt; ++ i) ss.pb ('');

             cout << ss << endl;

             continue;

         }

         for (int i = ; i < cnt; ++ i) ss.pb ('');

         len = sz(ss);

         int flag = ;

         for (int i = ; i < len; ++ i)

             flag = (flag* + ss[i] - '')  % ;

         flag = flag *  % ;

         ss += mp[( - flag) % ];

         cout << ss << endl;

     }

     return ;

 }

题意：有一个0，1矩阵(最大5000*5000)，你可以无限次数地交换任意两行的位置。求交换之后，单个只含有1的矩形的面积最大，并返回这个面积值。

解法：枚举矩形的左下角是从哪一列开始，统计每一行从这一列开始连续的1有多少个记录在num数组里，然后从大到小遍历num数组，并更新面积值即可。

tag:dp, think, good

 /*

  * Author:  Plumrain

  * Created Time:  2013-12-26 12:49

  * File Name: D.cpp

  */

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <algorithm>

 #include <vector>

 #include <cstdlib>

 #include <sstream>

 #include <fstream>

 #include <list>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <map>

 #include <set>

 #include <bitset>

 #include <cctype>

 #include <ctime>

 #include <utility>

 using namespace std;

 #define clr0(x) memset(x, 0, sizeof(x))

 #define clr1(x) memset(x, -1, sizeof(x))

 #define pb push_back

 #define sz(v) ((int)(v).size())

 #define all(t) t.begin(),t.end()

 #define INF 999999999999999999

 #define zero(x) (((x)>0?(x):-(x))<eps)

 #define out(x) cout<<#x<<":"<<(x)<<endl

 #define tst(a) cout<<a<<" "

 #define tst1(a) cout<<#a<<endl

 #define CINBEQUICKER std::ios::sync_with_stdio(false)

 const double eps = 1e-;

 const double PI = atan(1.0)*;

 const int inf =  / ;

 typedef vector<int> vi;

 typedef vector<string> vs;

 typedef vector<double> vd;

 typedef pair<int, int> pii;

 typedef long long int64;

 inline int Mymod (int a, int b) {int x=a%b; if(x<) x+=b; return x;}

 int n, m;

 int p[][], num[];

 char v[][];

 int main()

 {

 //    freopen("a.in","r",stdin);

     //freopen("a.out","w",stdout);

 //    std::ios::sync_with_stdio(false);

     while (scanf ("%d%d", &n, &m) != EOF){

         string s;

         for (int i = ; i < n; ++ i)

             scanf ("%s", v[i]);

         for (int i = ; i < n; ++ i){

             int tmp = m;

             for (int j = m-; j >= ; -- j){

                 if (v[i][j] == '')

                     tmp = j, p[i][j] = j;

                 else

                     p[i][j] = tmp;

             }

         }

         int ans = ;

         for (int i = ; i < m; ++ i){

             clr0 (num);

             for (int j = ; j < n; ++ j) num[p[j][i] - i] ++;

             int pos = ;

             while (pos && num[pos] == ) -- pos;

             int cnt = ;

             while (pos){

                 if (num[pos]) cnt += num[pos];

                 ans = max(cnt*pos, ans);

                 -- pos;

             }

         }

         printf ("%d\n", ans);

     }

     return ;

 }

CodeForces 221(div 2)的更多相关文章

Codeforces #344 Div.2
Codeforces #344 Div.2 Interview 题目描述:求两个序列的子序列或操作的和的最大值 solution 签到题时间复杂度:\(O(n^2)\) Print Check 题目 ...
Codeforces #345 Div.1
Codeforces #345 Div.1 打CF有助于提高做题的正确率. Watchmen 题目描述:求欧拉距离等于曼哈顿距离的点对个数. solution 签到题,其实就是求有多少对点在同一行或同 ...
Codeforces Beta Round #27 (Codeforces format, Div. 2)
Codeforces Beta Round #27 (Codeforces format, Div. 2) http://codeforces.com/contest/27 A #include< ...
Codeforces#441 Div.2 四小题
Codeforces#441 Div.2 四小题链接 A. Trip For Meal 小熊维尼喜欢吃蜂蜜.他每天要在朋友家享用N次蜂蜜 , 朋友A到B家的距离是 a ,A到C家的距离是b ,B到C ...
codeforces #592(Div.2)
codeforces #592(Div.2) A Pens and Pencils Tomorrow is a difficult day for Polycarp: he has to attend ...
codeforces #578(Div.2)
codeforces #578(Div.2) A. Hotelier Amugae has a hotel consisting of 1010 rooms. The rooms are number ...
codeforces #577(Div.2)
codeforces #577(Div.2) A Important Exam A class of students wrote a multiple-choice test. There are ...
codeforces #332 div 2 D. Spongebob and Squares
http://codeforces.com/contest/599/problem/D 题意:给出总的方格数x,问有多少种不同尺寸的矩形满足题意,输出方案数和长宽(3,5和5,3算两种) 思路:比赛的 ...
Codeforces Round #221 (Div. 1) B. Maximum Submatrix 2 dp排序
B. Maximum Submatrix 2 Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/problemset ...

随机推荐

iOS菜鸟之AFN的二次封装
我用一个单例类将一些常用的网络请求进行了二次封装,主要包括post请求 get请求图片文件上传下载视频的断点续传等功能. 首先大家先去github上下载AFN,将文件夹内的AFNetworki ...
java_设计模式_单例模式_Singleton Pattern（2016-08-04）
概念: 单例模式确保某个类只有一个实例,而且自行实例化并向整个系统提供这个实例. 适用场景: 在计算机系统中,线程池.缓存.日志对象.对话框.打印机.显卡的驱动程序对象常被设计成单例.这些应用都或多或 ...
mahout的安装、配置及运行java程序
一.下载安装包: http://mahout.apache.org/general/downloads.html 二.解压: 将下载的安装包解压到需要的目录下三.配置环境变量: export MAH ...
hdu 4502吉哥系列故事——临时工计划 (简单DP)
Problem Description 俗话说一分钱难倒英雄汉,高中几年下来,吉哥已经深深明白了这个道理,因此,新年开始存储一年的个人资金已经成了习惯,不过自从大学之后他不好意思再向大人要压岁钱了,只 ...
filter过滤器执行顺序
浏览器请求---->进入过滤器---->进入doFilter方法--->执行chain.doFilter()方法就会放行----->进入业务逻辑方法------>进入过滤 ...
script加defer="defer" 的意义
<script defer="defer">alert("页面加载完我才执行的")</script>先看到这段话然后再执行上面的 JS ...
nginx——rewrite模块
1.什么是Nginx的Rewrite规则? Rewrite主要的功能就是实现URL的重写,Nginx的Rewrite规则采用PCRE(Perl Compatible Regular Expressio ...
TatukGIS-TGIS_ShapeArc.GetPointOnLine
function GetPointOnLine(const _distance: Double; const _offset: Double; const _part: Integer): TGIS_ ...
CentOS 6.4编译安装淘宝web服务器Tengine
Tengine 是由淘宝核心系统部基于Nginx开发的Web服务器,它在Nginx的基础上,针对大访问量网站的需求,添加了很多功能和特性.Tengine的性能和稳定性已经在大型的网站如淘宝网,淘宝商城 ...
windows live writer 下载及安装
windowslive writer下载地址: http://www.microsoft.com/en-us/download/details.aspx?id=8621(不知为啥,这里我无法下载)或 ...

CodeForces 221(div 2)

CodeForces 221(div 2)的更多相关文章

随机推荐

热门专题