双指针+BFS
日志统计(双指针
我竟然忘记了如何写cmp!!!
bool cmp(t a, t b)
{
if (a.id != b.id) return a.id < b.id;
else
return a.ts < b.ts;
}
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int k,d,n;
struct t{
int ts;
int id;
};
t tt[100010];
bool cmp(t a, t b)
{
if (a.id != b.id) return a.id < b.id;
else
return a.ts < b.ts;
}
int main()
{
scanf("%d%d%d", &n,&d, &k);
for (int i = 0; i < n; i ++)
{
scanf("%d%d", &tt[i].ts, &tt[i].id);
}
sort (tt, tt + n, cmp);
//for (int i = 0; i < n; i ++) printf("%d %d\n",tt[i].id,tt[i].ts);
for (int i = 0; i < n; i ++)
{
int p = i;
while (tt[i].id == tt[i+1].id && i+1<n) i ++;
if (i - p + 1 < k) continue;
for (int l = p; l + k - 1 <= i; l ++)
{
int r = l + k - 1;
if (tt[r].ts - tt[l].ts < d)
{
printf("%d\n",tt[i].id);
break;
}
}
}
return 0;
}
献给阿尔吉侬的花束 (BFS模板
scanf(“%c”)时注意要不要getchar();
BFS每个点只会走一次
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
typedef pair<int, int> PII;
int t;
int r,c;
char map[202][202];
int dx[5] = {-1,0,1,0}, dy[5] = {0,1,0,-1};
int dis[202][202];
PII start, endd;
int f()
{
queue<PII> q;
q.push(start);
memset(dis, -1,sizeof dis);
dis[start.first][start.second] = 0;
while(q.size())
{
PII tt = q.front();
q.pop();
for (int i = 0; i < 4; i ++)
{
int x = tt.first + dx[i], y = tt.second + dy[i];
if (x < 1 || x > r || y < 1 || y > c) continue;
else if (map[x][y] == '#') continue;
else if (dis[x][y] != -1) continue;
q.push({x,y});
dis[x][y] = dis[tt.first][tt.second] + 1;
if (endd.first == x && endd.second == y) return dis[endd.first][endd.second];
}
}
return -1;
}
int main()
{
scanf("%d", &t);
while (t -- )
{
scanf("%d%d", &r,&c);
for (int i = 1; i <= r; i ++)
{
getchar(); // 特别注意!!!
for (int j = 1; j <= c; j ++)
{
scanf("%c", &map[i][j]);
if (map[i][j] == 'S')
start = {i,j};
else if (map[i][j] == 'E')
endd = {i,j};
}
}
int t = f();
if (t!=-1) printf("%d\n", t);
else printf("oop!\n");
}
return 0;
}
实验
还没完成。。
结果不太好
不过好像知道改的方向了
加油加油