2013-2014 ACM-ICPC, NEERC, Moscow Subregional Contest （2013区域赛练习）

最新推荐文章于 2022-07-15 08:58:37 发布

原创最新推荐文章于 2022-07-15 08:58:37 发布 · 4.1k 阅读

0 ·

CC 4.0 BY-SA版权

ACM_contest 同时被 2 个专栏收录

28 篇文章

订阅专栏

Codeforces_gym

4 篇文章

订阅专栏

本文回顾了2013年ACM-ICPC区域赛莫斯科子区域比赛，讨论了比赛中的A, B, H, I题目，并特别关注了队友在K题上的一次恶搞导致的F题解决过程。F题是一道结合模拟和动态规划的题目，通过修复一个小细节后顺利通过。同时提供了B题的优质代码和F题的完整代码链接。" 50625722,5599701,Coursera C语言进阶：排队游戏解析与实现,"['C++', '算法', '入门心得', 'Coursera', '递归']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

比赛链接：http://codeforces.com/gym/100257

比赛出了A,B,H,I, 队友在比赛中恶搞K题TLE，导致F题没时间调试，赛后加了一句flag = 0，F题就AC了，一个小细节没注意。

B题保存了一份好的代码

F题是一半模拟一半DP， F题代码在下面。

K题恶搞 https://github.com/ACM-Obsidian/Obsidian/blob/master/2013-10-20/K.cpp

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <string>
typedef unsigned long long ull;
typedef long long ll;

char s[111];
int n;

int go(int pos) {
    if(pos==n) return 1;
    int i;
    for(i=0;i<pos;i++) if(s[i] == s[pos]) break;
    if(i==pos && go(pos+1)) return 1;
    for(char c=s[pos]+1;c!='G';c++) {
        if(c==('9'+1)) c='A';
        s[pos]=c;
        for(i=0;i<pos;i++) if(s[i] == c) break;
        if(i != pos) continue;
        for(int j=pos+1;j<n;j++) s[j]='0';
        if(go(pos+1)) return 1;
    }
    return 0;
}

int main() {
    ull x;
    while(scanf("%llx", &x) != EOF) {
        x++;
        sprintf(s, "%llx", x);
        n = strlen(s);
        for(int i=0;i<n;i++) s[i] = toupper(s[i]);
        if(go(0)) printf("%s\n", s);
        else {
            memset(s, '0', sizeof(s));
            s[0]='1';
            n++;
            go(0);
            s[n]='\0';
            printf("%s\n", s);
        }
    }
    return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <string>
#define ll long long
using namespace std;
typedef pair<int, int> PII;
int a[2003], b[2003];
int dp[2003];
int n;
int main() {
    int i, j;
    scanf("%d", &n);
    for (i = 1; i <= n; i++) {
        int x, y;
        char ch;
        scanf("%d:%d %c", &x, &y, &ch);
        a[i] = x * 60 + y;
        b[i] = (ch == 'U');
    }
    int cnt = 0, last = -1e9;
    bool flag = 0;
    int pay = 0;
    for (i = 1; i <= n; i++) {
        if (a[i] - last <= 90) {
            if (b[i] == 0) {
                if (!pay) {
                    cnt += 26;
                    pay = 26;
                } else {
                    cnt += 44 - pay;
                    pay = 44;
                }
            } else if (!flag) {
                flag = 1;
                if (!pay) {
                    cnt += 28;
                    pay = 28;
                } else {
                    cnt += 44 - pay;
                    pay = 44;
                }
            } else {
                last = a[i];
                cnt += 28;
                pay = 28;
            }
        } else {
            last = a[i];
            if (b[i] == 0) {
                cnt += 26;
                pay = 26;
                flag =0;
            } else {
                flag = 1;
                cnt += 28;
                pay = 28;
            }
        }
        //printf("cnt = %d ", cnt);
    }
    printf("%d ", cnt);

    for (i = 0; i <= n; i++)
        dp[i] = 1e9;
    dp[0] = 0;
    a[0] = -1e9;
    for (i = 0; i < n; i++) {
        dp[i + 1] = min(dp[i + 1], dp[i] + (b[i + 1] == 1 ? 28 : 26));
    //  printf("%d////////\n", dp[i+1]);
        int cnt = 0;
        j = i + 1;
        int cur = a[i + 1];
        while (j <= n && a[j] - cur <= 90) {
            if (b[j] == 1)
                cnt++;
            if (cnt >= 2)
                break;
            j++;
        }
        j--;
        dp[j] = min(dp[j], dp[i] + 44);
    }
//  for(i = 1; i <= n; i++)
//      printf("%d~~~ ", dp[i]);
    printf("%d\n", dp[n]);
    return 0;
}
/*
2
00:00 U
23:59 S
5
10:00 U
10:30 S
10:50 U
11:20 U
12:51 S
4
20:00 S
21:30 S
21:31 S
21:32 S

10
1:11 U
1:12 S
1:13 U
1:14 S
3:33 S
3:43 U

 */