由于我有些看不懂这个题目,所以我是先找的他人的博客理解了一下题目。
所以我这里主要就是记录一下这道题啦,想到如何优化到100分,再更新。
66分
#include
#include
using namespace std;
// 神经元结构
struct neuron {
int ID, times;
double prev, preu; //v, u; // 由于后续这个v、u用处不大,我就没写上了
double a, b, c, d;
};
struct pluse {
int ID;
long long int r;
};
struct synapse {
int outID, inID, D;
double w;
};
neuron neurons[1001];
pluse pluses[1001];
synapse synapses[1001];
void InputData(int N, int P, int S) {
for (int id = 0; id < N;) {
int RN;
double v, u, a, b, c, d;
cin>>RN>>v>>u>>a>>b>>c>>d;
for (int j = 0; j < RN; ++j, ++id) {
neurons[id].times = 0;
neurons[id].prev = v;
neurons[id].preu = u;
neurons[id].ID = id;
neurons[id].a = a;
neurons[id].b = b;
neurons[id].c = c;
neurons[id].d = d;
}
}
for (int i = 0; i < P; ++i) {
long long int r;
cin>>r;
pluses[i].ID = N + i;
pluses[i].r = r;
}
for (int i = 0; i < S; ++i) {
cin>>synapses[i].outID>>synapses[i].inID>>synapses[i].w>>synapses[i].D;
}
}
static unsigned long Next = 1;
/* RAND_MAX assumed to be 32767 */
int myrand(void) {
Next = Next * 1103515245 + 12345;
return((unsigned)(Next/65536) % 32768);
}
int main() {
int N, S, P, T;
double deltaT;
cin>>N>>S>>P>>T;
cin>>deltaT;
InputData(N, P, S);
// 记录每个时刻的 IK !!!关键点 !!!
double IK[1001][2001] = {0}; // int IK[1001][100101];
for (int t = 1; t myrand() 时发放脉冲信号
for (int j = 0; j < S; ++j) { // 每个突触
if (synapses[j].outID == i + N) {
IK[synapses[j].inID][t + synapses[j].D] += synapses[j].w;
}
}
}
}
}
// 更新每个时刻的神经元
for (int t = 1; t = 30) { // 神经元发放脉冲
for (int j = 0; j < S; ++j) { // 对于每个突触
if (synapses[j].outID == i) {
IK[synapses[j].inID][t + synapses[j].D] += synapses[j].w; // += synapses[j].w; not synapses[synapses[j].inID].w;
}
}
v = neurons[i].c;
u = neurons[i].d + u;
++neurons[i].times;
}
neurons[i].prev = v;
neurons[i].preu = u;
}
}
// 找出最后的答案
double minVV = neurons[0].prev, maxVV = neurons[0].prev;
int minTimes = neurons[0].times, maxTimes = neurons[0].times;
for (int i = 1; i < N; ++i) {
minVV = min(minVV, neurons[i].prev);
maxVV = max(maxVV, neurons[i].prev);
minTimes = min(minTimes, neurons[i].times);
maxTimes = max(maxTimes, neurons[i].times);
}
cout<
Original: https://blog.csdn.net/qq_45936312/article/details/124258193
Author: X-omil
Title: CSP CCF: 202109-3 脉冲神经网络 (C++) 66分
原创文章受到原创版权保护。转载请注明出处:https://www.johngo689.com/689411/
转载文章受原作者版权保护。转载请注明原作者出处!